./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:41:29,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:41:29,289 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:41:29,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:41:29,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:41:29,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:41:29,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:41:29,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:41:29,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:41:29,322 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:41:29,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:41:29,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:41:29,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:41:29,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:41:29,324 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:41:29,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:41:29,325 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:41:29,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:41:29,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:41:29,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:41:29,327 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:41:29,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:41:29,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:41:29,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:41:29,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:41:29,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:41:29,330 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:41:29,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:41:29,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:41:29,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:41:29,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:41:29,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:41:29,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:29,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:41:29,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:41:29,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:41:29,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:41:29,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:41:29,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:41:29,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:41:29,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:41:29,335 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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2023-11-29 02:41:29,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:41:29,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:41:29,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:41:29,580 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:41:29,580 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:41:29,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2023-11-29 02:41:32,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:41:32,689 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:41:32,690 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2023-11-29 02:41:32,709 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/9fa347c70/6e755af033fd4fcba40a6cd541f6b3da/FLAG58f543a2e [2023-11-29 02:41:32,724 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/9fa347c70/6e755af033fd4fcba40a6cd541f6b3da [2023-11-29 02:41:32,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:41:32,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:41:32,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:32,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:41:32,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:41:32,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:32" (1/1) ... [2023-11-29 02:41:32,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14939386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:32, skipping insertion in model container [2023-11-29 02:41:32,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:32" (1/1) ... [2023-11-29 02:41:32,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:33,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:33,298 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 02:41:33,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61442442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:33, skipping insertion in model container [2023-11-29 02:41:33,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:33,300 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:41:33,302 INFO L158 Benchmark]: Toolchain (without parser) took 573.11ms. Allocated memory is still 146.8MB. Free memory was 97.8MB in the beginning and 76.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:41:33,302 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:41:33,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.13ms. Allocated memory is still 146.8MB. Free memory was 97.8MB in the beginning and 76.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:41:33,304 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.19ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.13ms. Allocated memory is still 146.8MB. Free memory was 97.8MB in the beginning and 76.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:41:35,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:41:35,285 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:41:35,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:41:35,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:41:35,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:41:35,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:41:35,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:41:35,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:41:35,323 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:41:35,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:41:35,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:41:35,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:41:35,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:41:35,326 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:41:35,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:41:35,327 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:41:35,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:41:35,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:41:35,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:41:35,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:41:35,330 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:41:35,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:41:35,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:41:35,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:41:35,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:41:35,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:41:35,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:41:35,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:41:35,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:41:35,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:41:35,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:41:35,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:41:35,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:41:35,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:35,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:41:35,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:41:35,335 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:41:35,335 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:41:35,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:41:35,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:41:35,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:41:35,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:41:35,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:41:35,337 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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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_fac65625-e766-47e3-8f7e-d8ff44606d6c/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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2023-11-29 02:41:35,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:41:35,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:41:35,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:41:35,678 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:41:35,678 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:41:35,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2023-11-29 02:41:38,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:41:38,815 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:41:38,816 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2023-11-29 02:41:38,834 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/d015a3cd2/c11f5ba685dc4a438af76087b0b2b73d/FLAG3f9fcd681 [2023-11-29 02:41:38,848 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/data/d015a3cd2/c11f5ba685dc4a438af76087b0b2b73d [2023-11-29 02:41:38,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:41:38,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:41:38,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:38,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:41:38,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:41:38,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:38" (1/1) ... [2023-11-29 02:41:38,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1131b336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:38, skipping insertion in model container [2023-11-29 02:41:38,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:41:38" (1/1) ... [2023-11-29 02:41:38,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:39,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:39,510 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:41:39,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:41:39,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:39,621 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:41:39,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:41:39,747 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:41:39,755 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:41:39,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39 WrapperNode [2023-11-29 02:41:39,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:41:39,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:41:39,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:41:39,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:41:39,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:39,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:39,880 INFO L138 Inliner]: procedures = 180, calls = 338, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1214 [2023-11-29 02:41:39,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:41:39,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:41:39,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:41:39,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:41:39,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:39,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:39,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,006 INFO L175 MemorySlicer]: Split 308 memory accesses to 4 slices as follows [2, 267, 34, 5]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 58, 4, 1]. [2023-11-29 02:41:40,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:41:40,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:41:40,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:41:40,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:41:40,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (1/1) ... [2023-11-29 02:41:40,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:41:40,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:41:40,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:41:40,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:41:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 02:41:40,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 02:41:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:41:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:41:40,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:41:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 02:41:40,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 02:41:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:41:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:41:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:41:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:41:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:41:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:41:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:41:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:41:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:41:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:41:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:41:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:41:40,415 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:41:40,417 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:41:40,448 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:40,479 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:40,527 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:40,548 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:41:45,769 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:41:45,946 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:41:45,946 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 02:41:45,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:41:45 BoogieIcfgContainer [2023-11-29 02:41:45,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:41:45,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:41:45,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:41:45,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:41:45,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:41:38" (1/3) ... [2023-11-29 02:41:45,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e195f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:41:45, skipping insertion in model container [2023-11-29 02:41:45,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:41:39" (2/3) ... [2023-11-29 02:41:45,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e195f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:41:45, skipping insertion in model container [2023-11-29 02:41:45,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:41:45" (3/3) ... [2023-11-29 02:41:45,957 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2023-11-29 02:41:45,977 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:41:45,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 638 error locations. [2023-11-29 02:41:46,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:41:46,057 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;@37b380d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:41:46,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 638 error locations. [2023-11-29 02:41:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 02:41:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:41:46,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:46,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:41:46,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:41:46,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 64901, now seen corresponding path program 1 times [2023-11-29 02:41:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643537827] [2023-11-29 02:41:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:46,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:46,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:46,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:46,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 02:41:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:46,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:41:46,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:46,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:41:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:46,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:46,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:46,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643537827] [2023-11-29 02:41:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643537827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:41:46,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975352088] [2023-11-29 02:41:46,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:41:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:41:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:46,464 INFO L87 Difference]: Start difference. First operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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 02:41:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:49,059 INFO L93 Difference]: Finished difference Result 1321 states and 1406 transitions. [2023-11-29 02:41:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:41:49,061 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 02:41:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:49,083 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 02:41:49,084 INFO L226 Difference]: Without dead ends: 1320 [2023-11-29 02:41:49,085 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 02:41:49,088 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 1078 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:49,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 785 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:41:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-11-29 02:41:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1147. [2023-11-29 02:41:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 514 states have (on average 2.3463035019455254) internal successors, (1206), 1140 states have internal predecessors, (1206), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:41:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1224 transitions. [2023-11-29 02:41:49,179 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1224 transitions. Word has length 2 [2023-11-29 02:41:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:49,180 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1224 transitions. [2023-11-29 02:41:49,180 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 02:41:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1224 transitions. [2023-11-29 02:41:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:41:49,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:49,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:41:49,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:41:49,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:49,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:41:49,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 64902, now seen corresponding path program 1 times [2023-11-29 02:41:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261906442] [2023-11-29 02:41:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:49,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:49,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 02:41:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:49,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:41:49,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:49,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:41:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:49,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:49,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261906442] [2023-11-29 02:41:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261906442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:49,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:41:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101544858] [2023-11-29 02:41:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:49,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:41:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:41:49,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:49,533 INFO L87 Difference]: Start difference. First operand 1147 states and 1224 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 02:41:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:53,725 INFO L93 Difference]: Finished difference Result 1705 states and 1834 transitions. [2023-11-29 02:41:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:41:53,726 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 02:41:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:53,736 INFO L225 Difference]: With dead ends: 1705 [2023-11-29 02:41:53,736 INFO L226 Difference]: Without dead ends: 1705 [2023-11-29 02:41:53,736 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 02:41:53,737 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 599 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:53,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1454 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:41:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2023-11-29 02:41:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1316. [2023-11-29 02:41:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 684 states have (on average 2.3201754385964914) internal successors, (1587), 1309 states have internal predecessors, (1587), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:41:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1605 transitions. [2023-11-29 02:41:53,777 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1605 transitions. Word has length 2 [2023-11-29 02:41:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1605 transitions. [2023-11-29 02:41:53,778 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 02:41:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1605 transitions. [2023-11-29 02:41:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:41:53,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:53,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:41:53,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:41:53,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:53,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:41:53,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -191359793, now seen corresponding path program 1 times [2023-11-29 02:41:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909598274] [2023-11-29 02:41:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:53,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:53,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:53,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:53,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:41:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:54,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:41:54,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:54,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:41:54,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:41:54,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:41:54,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:41:54,265 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:41:54,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:41:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:54,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:54,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909598274] [2023-11-29 02:41:54,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909598274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:54,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:54,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:41:54,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582993177] [2023-11-29 02:41:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:54,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:41:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:41:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:41:54,294 INFO L87 Difference]: Start difference. First operand 1316 states and 1605 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 02:41:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:41:58,181 INFO L93 Difference]: Finished difference Result 1483 states and 1783 transitions. [2023-11-29 02:41:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:41:58,182 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 02:41:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:41:58,189 INFO L225 Difference]: With dead ends: 1483 [2023-11-29 02:41:58,189 INFO L226 Difference]: Without dead ends: 1483 [2023-11-29 02:41:58,190 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 02:41:58,191 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 2404 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:41:58,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 403 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:41:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2023-11-29 02:41:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1136. [2023-11-29 02:41:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 514 states have (on average 2.32295719844358) internal successors, (1194), 1129 states have internal predecessors, (1194), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:41:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1212 transitions. [2023-11-29 02:41:58,219 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1212 transitions. Word has length 6 [2023-11-29 02:41:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:41:58,219 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1212 transitions. [2023-11-29 02:41:58,220 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 02:41:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1212 transitions. [2023-11-29 02:41:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:41:58,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:41:58,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:41:58,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:41:58,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:58,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:41:58,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:41:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186277, now seen corresponding path program 1 times [2023-11-29 02:41:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:41:58,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978785497] [2023-11-29 02:41:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:41:58,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:41:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:41:58,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:41:58,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 02:41:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:41:58,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:41:58,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:41:58,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:41:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:41:58,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:41:58,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:41:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978785497] [2023-11-29 02:41:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978785497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:41:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:41:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:41:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275525173] [2023-11-29 02:41:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:41:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:41:58,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:41:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:41:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:41:58,583 INFO L87 Difference]: Start difference. First operand 1136 states and 1212 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 02:42:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:01,110 INFO L93 Difference]: Finished difference Result 1430 states and 1536 transitions. [2023-11-29 02:42:01,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:01,112 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 02:42:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:01,119 INFO L225 Difference]: With dead ends: 1430 [2023-11-29 02:42:01,119 INFO L226 Difference]: Without dead ends: 1430 [2023-11-29 02:42:01,119 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 02:42:01,120 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 895 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1265 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:42:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2023-11-29 02:42:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1087. [2023-11-29 02:42:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 514 states have (on average 2.227626459143969) internal successors, (1145), 1080 states have internal predecessors, (1145), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1163 transitions. [2023-11-29 02:42:01,147 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1163 transitions. Word has length 7 [2023-11-29 02:42:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:01,147 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1163 transitions. [2023-11-29 02:42:01,148 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 02:42:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1163 transitions. [2023-11-29 02:42:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:42:01,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:01,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:01,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 02:42:01,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:01,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:01,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186276, now seen corresponding path program 1 times [2023-11-29 02:42:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813398126] [2023-11-29 02:42:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:01,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:01,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 02:42:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:01,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:01,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:01,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:42:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:01,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:01,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813398126] [2023-11-29 02:42:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813398126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:01,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:42:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106339395] [2023-11-29 02:42:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:01,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:01,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:01,549 INFO L87 Difference]: Start difference. First operand 1087 states and 1163 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 02:42:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:05,320 INFO L93 Difference]: Finished difference Result 1500 states and 1609 transitions. [2023-11-29 02:42:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:05,321 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 02:42:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:05,329 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 02:42:05,329 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 02:42:05,330 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 02:42:05,331 INFO L413 NwaCegarLoop]: 1138 mSDtfsCounter, 613 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:05,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1590 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 02:42:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 02:42:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1100. [2023-11-29 02:42:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 537 states have (on average 2.2197392923649906) internal successors, (1192), 1093 states have internal predecessors, (1192), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1210 transitions. [2023-11-29 02:42:05,360 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1210 transitions. Word has length 7 [2023-11-29 02:42:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:05,360 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1210 transitions. [2023-11-29 02:42:05,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 02:42:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1210 transitions. [2023-11-29 02:42:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:42:05,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:05,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:05,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 02:42:05,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:05,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:05,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash -505370728, now seen corresponding path program 1 times [2023-11-29 02:42:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650541043] [2023-11-29 02:42:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:05,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:05,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 02:42:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:05,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:42:05,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:05,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:05,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650541043] [2023-11-29 02:42:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650541043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308019181] [2023-11-29 02:42:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:05,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:05,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:05,752 INFO L87 Difference]: Start difference. First operand 1100 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:08,319 INFO L93 Difference]: Finished difference Result 1689 states and 1843 transitions. [2023-11-29 02:42:08,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:42:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 02:42:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:08,329 INFO L225 Difference]: With dead ends: 1689 [2023-11-29 02:42:08,329 INFO L226 Difference]: Without dead ends: 1689 [2023-11-29 02:42:08,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:08,330 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 689 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:08,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 2996 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:42:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2023-11-29 02:42:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1304. [2023-11-29 02:42:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 741 states have (on average 2.174089068825911) internal successors, (1611), 1297 states have internal predecessors, (1611), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1629 transitions. [2023-11-29 02:42:08,358 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1629 transitions. Word has length 10 [2023-11-29 02:42:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:08,358 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 1629 transitions. [2023-11-29 02:42:08,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1629 transitions. [2023-11-29 02:42:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:42:08,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:08,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:08,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:08,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:08,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -915022471, now seen corresponding path program 1 times [2023-11-29 02:42:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331117609] [2023-11-29 02:42:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:08,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:08,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:08,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 02:42:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:08,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:42:08,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:08,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:08,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331117609] [2023-11-29 02:42:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331117609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585543730] [2023-11-29 02:42:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:08,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:08,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:08,710 INFO L87 Difference]: Start difference. First operand 1304 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:09,507 INFO L93 Difference]: Finished difference Result 1250 states and 1549 transitions. [2023-11-29 02:42:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 02:42:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:09,514 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 02:42:09,514 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 02:42:09,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:09,514 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 70 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:09,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1897 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:42:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 02:42:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-11-29 02:42:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 711 states have (on average 2.1533052039381153) internal successors, (1531), 1243 states have internal predecessors, (1531), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1549 transitions. [2023-11-29 02:42:09,535 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1549 transitions. Word has length 12 [2023-11-29 02:42:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:09,535 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1549 transitions. [2023-11-29 02:42:09,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1549 transitions. [2023-11-29 02:42:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 02:42:09,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:09,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:09,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:09,737 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:09,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1131726450, now seen corresponding path program 1 times [2023-11-29 02:42:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:09,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045961824] [2023-11-29 02:42:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:09,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:09,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:09,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:09,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 02:42:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:09,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:09,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:09,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:09,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:09,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045961824] [2023-11-29 02:42:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045961824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:09,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397793772] [2023-11-29 02:42:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:09,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:09,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:09,872 INFO L87 Difference]: Start difference. First operand 1250 states and 1549 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:10,954 INFO L93 Difference]: Finished difference Result 1236 states and 1507 transitions. [2023-11-29 02:42:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:10,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-11-29 02:42:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:10,962 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 02:42:10,962 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 02:42:10,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:10,963 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 58 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:10,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2802 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:42:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 02:42:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1234. [2023-11-29 02:42:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 709 states have (on average 2.0973201692524683) internal successors, (1487), 1227 states have internal predecessors, (1487), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1505 transitions. [2023-11-29 02:42:10,986 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1505 transitions. Word has length 14 [2023-11-29 02:42:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:10,986 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1505 transitions. [2023-11-29 02:42:10,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1505 transitions. [2023-11-29 02:42:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 02:42:10,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:10,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:10,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:11,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:11,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr636ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:11,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1857646529, now seen corresponding path program 1 times [2023-11-29 02:42:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:11,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928206072] [2023-11-29 02:42:11,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:11,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:11,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:11,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:11,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 02:42:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:11,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:42:11,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:11,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:42:11,333 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:42:11,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:42:11,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 02:42:11,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:42:11,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 02:42:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:11,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:11,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:11,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928206072] [2023-11-29 02:42:11,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928206072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:11,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745769045] [2023-11-29 02:42:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:11,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:11,408 INFO L87 Difference]: Start difference. First operand 1234 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 02:42:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:13,738 INFO L93 Difference]: Finished difference Result 2201 states and 2578 transitions. [2023-11-29 02:42:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 02:42:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:13,748 INFO L225 Difference]: With dead ends: 2201 [2023-11-29 02:42:13,748 INFO L226 Difference]: Without dead ends: 2201 [2023-11-29 02:42:13,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:13,749 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 1007 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:13,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3214 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 02:42:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2023-11-29 02:42:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1233. [2023-11-29 02:42:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 708 states have (on average 2.097457627118644) internal successors, (1485), 1226 states have internal predecessors, (1485), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1503 transitions. [2023-11-29 02:42:13,773 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1503 transitions. Word has length 15 [2023-11-29 02:42:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:13,774 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1503 transitions. [2023-11-29 02:42:13,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 02:42:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1503 transitions. [2023-11-29 02:42:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 02:42:13,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:13,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:13,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 02:42:13,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:13,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:13,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash -72847630, now seen corresponding path program 1 times [2023-11-29 02:42:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833476970] [2023-11-29 02:42:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:13,978 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:13,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 02:42:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:14,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:42:14,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:14,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:14,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833476970] [2023-11-29 02:42:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833476970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:14,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:14,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322292429] [2023-11-29 02:42:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:42:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:14,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:42:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:42:14,147 INFO L87 Difference]: Start difference. First operand 1233 states and 1503 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 02:42:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:14,981 INFO L93 Difference]: Finished difference Result 1179 states and 1423 transitions. [2023-11-29 02:42:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:42:14,983 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 02:42:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:14,988 INFO L225 Difference]: With dead ends: 1179 [2023-11-29 02:42:14,988 INFO L226 Difference]: Without dead ends: 1179 [2023-11-29 02:42:14,988 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 02:42:14,989 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 70 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:14,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1781 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:42:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2023-11-29 02:42:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2023-11-29 02:42:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 678 states have (on average 2.0722713864306783) internal successors, (1405), 1172 states have internal predecessors, (1405), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1423 transitions. [2023-11-29 02:42:15,015 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1423 transitions. Word has length 15 [2023-11-29 02:42:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:15,015 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1423 transitions. [2023-11-29 02:42:15,015 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 02:42:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1423 transitions. [2023-11-29 02:42:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 02:42:15,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:15,016 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 02:42:15,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:42:15,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:15,219 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:15,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1287098164, now seen corresponding path program 1 times [2023-11-29 02:42:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:15,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831079473] [2023-11-29 02:42:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:15,221 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:15,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 02:42:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:15,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:15,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:15,407 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:15,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831079473] [2023-11-29 02:42:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831079473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:15,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:15,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99446386] [2023-11-29 02:42:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:15,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:15,408 INFO L87 Difference]: Start difference. First operand 1179 states and 1423 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 02:42:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:16,418 INFO L93 Difference]: Finished difference Result 1165 states and 1381 transitions. [2023-11-29 02:42:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:16,419 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 02:42:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:16,425 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 02:42:16,425 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 02:42:16,425 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 02:42:16,426 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 58 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:16,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2628 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:42:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 02:42:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1163. [2023-11-29 02:42:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 676 states have (on average 2.0133136094674557) internal successors, (1361), 1156 states have internal predecessors, (1361), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1379 transitions. [2023-11-29 02:42:16,448 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1379 transitions. Word has length 17 [2023-11-29 02:42:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:16,448 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1379 transitions. [2023-11-29 02:42:16,448 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 02:42:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1379 transitions. [2023-11-29 02:42:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 02:42:16,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:16,449 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 02:42:16,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:42:16,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:16,653 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:16,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 25746362, now seen corresponding path program 1 times [2023-11-29 02:42:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195562478] [2023-11-29 02:42:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:16,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:16,655 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:16,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 02:42:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:16,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:16,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:42:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:16,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:16,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195562478] [2023-11-29 02:42:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195562478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846669318] [2023-11-29 02:42:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:16,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:16,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:16,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:16,879 INFO L87 Difference]: Start difference. First operand 1163 states and 1379 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 02:42:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:19,525 INFO L93 Difference]: Finished difference Result 1511 states and 1841 transitions. [2023-11-29 02:42:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:19,526 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 02:42:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:19,531 INFO L225 Difference]: With dead ends: 1511 [2023-11-29 02:42:19,532 INFO L226 Difference]: Without dead ends: 1511 [2023-11-29 02:42:19,532 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 02:42:19,532 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 760 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:19,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1267 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 02:42:19,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2023-11-29 02:42:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1159. [2023-11-29 02:42:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 676 states have (on average 2.0014792899408285) internal successors, (1353), 1152 states have internal predecessors, (1353), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1371 transitions. [2023-11-29 02:42:19,550 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1371 transitions. Word has length 31 [2023-11-29 02:42:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:19,550 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1371 transitions. [2023-11-29 02:42:19,550 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 02:42:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1371 transitions. [2023-11-29 02:42:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 02:42:19,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:19,551 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 02:42:19,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:19,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:19,752 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:19,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 25746363, now seen corresponding path program 1 times [2023-11-29 02:42:19,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:19,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663606123] [2023-11-29 02:42:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:19,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:19,754 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:19,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 02:42:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:19,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:42:19,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:19,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:42:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:20,131 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:20,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663606123] [2023-11-29 02:42:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663606123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:20,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:20,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562004385] [2023-11-29 02:42:20,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:20,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:20,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:20,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:20,133 INFO L87 Difference]: Start difference. First operand 1159 states and 1371 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 02:42:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:24,403 INFO L93 Difference]: Finished difference Result 1613 states and 1922 transitions. [2023-11-29 02:42:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:24,404 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 02:42:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:24,410 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 02:42:24,410 INFO L226 Difference]: Without dead ends: 1613 [2023-11-29 02:42:24,411 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 02:42:24,411 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 480 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:24,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2159 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 02:42:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-11-29 02:42:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1155. [2023-11-29 02:42:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 676 states have (on average 1.9896449704142012) internal successors, (1345), 1148 states have internal predecessors, (1345), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1363 transitions. [2023-11-29 02:42:24,426 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1363 transitions. Word has length 31 [2023-11-29 02:42:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:24,426 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1363 transitions. [2023-11-29 02:42:24,426 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 02:42:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1363 transitions. [2023-11-29 02:42:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:42:24,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:24,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:24,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 02:42:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:24,628 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:24,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1619588407, now seen corresponding path program 1 times [2023-11-29 02:42:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619003895] [2023-11-29 02:42:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:24,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:24,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 02:42:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:24,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:24,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:24,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:24,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619003895] [2023-11-29 02:42:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619003895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:24,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:24,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640431346] [2023-11-29 02:42:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:24,867 INFO L87 Difference]: Start difference. First operand 1155 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:25,985 INFO L93 Difference]: Finished difference Result 1143 states and 1343 transitions. [2023-11-29 02:42:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:25,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 02:42:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:25,992 INFO L225 Difference]: With dead ends: 1143 [2023-11-29 02:42:25,992 INFO L226 Difference]: Without dead ends: 1143 [2023-11-29 02:42:25,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:25,993 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 23 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:25,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2614 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:42:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-29 02:42:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2023-11-29 02:42:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 664 states have (on average 1.9954819277108433) internal successors, (1325), 1136 states have internal predecessors, (1325), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1343 transitions. [2023-11-29 02:42:26,009 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1343 transitions. Word has length 50 [2023-11-29 02:42:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:26,009 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1343 transitions. [2023-11-29 02:42:26,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:42:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1343 transitions. [2023-11-29 02:42:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:42:26,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:26,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:42:26,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:26,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:26,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -597599178, now seen corresponding path program 1 times [2023-11-29 02:42:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926921627] [2023-11-29 02:42:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:26,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:26,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:26,213 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:26,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 02:42:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:26,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:42:26,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:42:26,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:42:26,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:42:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:42:26,965 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:42:26,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:42:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:26,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:26,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:26,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926921627] [2023-11-29 02:42:26,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926921627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:42:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080401914] [2023-11-29 02:42:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:26,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:26,979 INFO L87 Difference]: Start difference. First operand 1143 states and 1343 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 02:42:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:30,066 INFO L93 Difference]: Finished difference Result 1457 states and 1775 transitions. [2023-11-29 02:42:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:30,068 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 02:42:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:30,075 INFO L225 Difference]: With dead ends: 1457 [2023-11-29 02:42:30,075 INFO L226 Difference]: Without dead ends: 1457 [2023-11-29 02:42:30,075 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 02:42:30,076 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 968 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:30,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 704 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 02:42:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-11-29 02:42:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1082. [2023-11-29 02:42:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1248 transitions. [2023-11-29 02:42:30,095 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1248 transitions. Word has length 54 [2023-11-29 02:42:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:30,095 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1248 transitions. [2023-11-29 02:42:30,095 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 02:42:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1248 transitions. [2023-11-29 02:42:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 02:42:30,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:30,097 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 02:42:30,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:30,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:30,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:30,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 940938836, now seen corresponding path program 1 times [2023-11-29 02:42:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:30,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446855942] [2023-11-29 02:42:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:30,299 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:30,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 02:42:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:30,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:42:30,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:30,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:42:30,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:42:30,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:42:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:30,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:30,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446855942] [2023-11-29 02:42:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446855942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977865144] [2023-11-29 02:42:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:30,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:42:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:42:30,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:30,616 INFO L87 Difference]: Start difference. First operand 1082 states and 1248 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 02:42:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:33,824 INFO L93 Difference]: Finished difference Result 1081 states and 1247 transitions. [2023-11-29 02:42:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:42:33,825 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 02:42:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:33,829 INFO L225 Difference]: With dead ends: 1081 [2023-11-29 02:42:33,829 INFO L226 Difference]: Without dead ends: 1081 [2023-11-29 02:42:33,829 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 02:42:33,830 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 3 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:33,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 02:42:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-11-29 02:42:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2023-11-29 02:42:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 641 states have (on average 1.9173166926677068) internal successors, (1229), 1074 states have internal predecessors, (1229), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1247 transitions. [2023-11-29 02:42:33,843 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1247 transitions. Word has length 58 [2023-11-29 02:42:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:33,843 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1247 transitions. [2023-11-29 02:42:33,843 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 02:42:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1247 transitions. [2023-11-29 02:42:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 02:42:33,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:33,844 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 02:42:33,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 02:42:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:34,044 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:34,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 940938837, now seen corresponding path program 1 times [2023-11-29 02:42:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:34,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268083857] [2023-11-29 02:42:34,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:34,047 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:34,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 02:42:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:34,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 02:42:34,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:34,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:42:34,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:42:34,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:42:34,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 02:42:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:34,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:34,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268083857] [2023-11-29 02:42:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268083857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:34,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314831824] [2023-11-29 02:42:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:34,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:42:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:34,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:42:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:42:34,419 INFO L87 Difference]: Start difference. First operand 1081 states and 1247 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 02:42:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:38,498 INFO L93 Difference]: Finished difference Result 1080 states and 1246 transitions. [2023-11-29 02:42:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:42:38,499 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 02:42:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:38,503 INFO L225 Difference]: With dead ends: 1080 [2023-11-29 02:42:38,504 INFO L226 Difference]: Without dead ends: 1080 [2023-11-29 02:42:38,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:42:38,504 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:38,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2272 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 02:42:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-11-29 02:42:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2023-11-29 02:42:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 640 states have (on average 1.91875) internal successors, (1228), 1073 states have internal predecessors, (1228), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 02:42:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1246 transitions. [2023-11-29 02:42:38,517 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1246 transitions. Word has length 58 [2023-11-29 02:42:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:38,517 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1246 transitions. [2023-11-29 02:42:38,517 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 02:42:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1246 transitions. [2023-11-29 02:42:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:42:38,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:38,518 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 02:42:38,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 02:42:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:38,719 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:38,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1104579896, now seen corresponding path program 1 times [2023-11-29 02:42:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034060563] [2023-11-29 02:42:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:38,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:38,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:38,722 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:38,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 02:42:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:39,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:42:39,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:39,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:42:39,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034060563] [2023-11-29 02:42:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034060563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:42:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:42:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:42:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312754798] [2023-11-29 02:42:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:42:39,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:42:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:42:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:42:39,045 INFO L87 Difference]: Start difference. First operand 1080 states and 1246 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 02:42:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:40,149 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2023-11-29 02:42:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:42:40,151 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 02:42:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:40,156 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 02:42:40,156 INFO L226 Difference]: Without dead ends: 1082 [2023-11-29 02:42:40,156 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 02:42:40,157 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:40,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2553 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:42:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-11-29 02:42:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2023-11-29 02:42:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:42:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1249 transitions. [2023-11-29 02:42:40,174 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1249 transitions. Word has length 64 [2023-11-29 02:42:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:40,175 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1249 transitions. [2023-11-29 02:42:40,175 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 02:42:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1249 transitions. [2023-11-29 02:42:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 02:42:40,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:40,176 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 02:42:40,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 02:42:40,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:40,376 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:40,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1704596296, now seen corresponding path program 1 times [2023-11-29 02:42:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688646501] [2023-11-29 02:42:40,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:42:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:40,379 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:40,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 02:42:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:42:40,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:42:40,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:40,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:40,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688646501] [2023-11-29 02:42:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688646501] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:40,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:42:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376707586] [2023-11-29 02:42:40,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:40,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:42:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:40,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:42:40,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:42:40,777 INFO L87 Difference]: Start difference. First operand 1082 states and 1249 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 02:42:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:42,300 INFO L93 Difference]: Finished difference Result 1091 states and 1263 transitions. [2023-11-29 02:42:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:42:42,301 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 02:42:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:42,305 INFO L225 Difference]: With dead ends: 1091 [2023-11-29 02:42:42,305 INFO L226 Difference]: Without dead ends: 1091 [2023-11-29 02:42:42,306 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 02:42:42,306 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 6 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:42,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3399 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:42:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2023-11-29 02:42:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1090. [2023-11-29 02:42:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 648 states have (on average 1.9182098765432098) internal successors, (1243), 1082 states have internal predecessors, (1243), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:42:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1262 transitions. [2023-11-29 02:42:42,322 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1262 transitions. Word has length 65 [2023-11-29 02:42:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1262 transitions. [2023-11-29 02:42:42,322 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 02:42:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1262 transitions. [2023-11-29 02:42:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 02:42:42,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:42,323 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 02:42:42,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 02:42:42,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:42,524 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:42,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:42,524 INFO L85 PathProgramCache]: Analyzing trace with hash -644902600, now seen corresponding path program 2 times [2023-11-29 02:42:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:42,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707900334] [2023-11-29 02:42:42,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:42:42,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 02:42:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:42,526 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:42,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 02:42:43,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:42:43,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:43,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:42:43,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:43,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:43,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707900334] [2023-11-29 02:42:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707900334] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:43,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:42:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939143748] [2023-11-29 02:42:43,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:42:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:42:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:42:43,232 INFO L87 Difference]: Start difference. First operand 1090 states and 1262 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 02:42:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:45,941 INFO L93 Difference]: Finished difference Result 1105 states and 1284 transitions. [2023-11-29 02:42:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:42:45,942 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 02:42:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:45,946 INFO L225 Difference]: With dead ends: 1105 [2023-11-29 02:42:45,946 INFO L226 Difference]: Without dead ends: 1103 [2023-11-29 02:42:45,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:42:45,947 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 12 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5950 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:45,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5950 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 02:42:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-11-29 02:42:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1099. [2023-11-29 02:42:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 657 states have (on average 1.9101978691019788) internal successors, (1255), 1091 states have internal predecessors, (1255), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:42:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1274 transitions. [2023-11-29 02:42:45,966 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1274 transitions. Word has length 68 [2023-11-29 02:42:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:45,966 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1274 transitions. [2023-11-29 02:42:45,966 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 02:42:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1274 transitions. [2023-11-29 02:42:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 02:42:45,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:45,967 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 02:42:45,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 02:42:46,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:46,167 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:46,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 162879288, now seen corresponding path program 3 times [2023-11-29 02:42:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197579209] [2023-11-29 02:42:46,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:42:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:46,170 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:46,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:46,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:42:46,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:46,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:42:46,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:47,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:47,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197579209] [2023-11-29 02:42:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197579209] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:47,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:42:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619399098] [2023-11-29 02:42:47,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:47,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:42:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:42:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:42:47,717 INFO L87 Difference]: Start difference. First operand 1099 states and 1274 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 02:42:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:42:54,169 INFO L93 Difference]: Finished difference Result 1129 states and 1324 transitions. [2023-11-29 02:42:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:42:54,170 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 02:42:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:42:54,173 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 02:42:54,173 INFO L226 Difference]: Without dead ends: 1126 [2023-11-29 02:42:54,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:42:54,175 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 24 mSDsluCounter, 9337 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10187 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:42:54,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10187 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 02:42:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-29 02:42:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1117. [2023-11-29 02:42:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 675 states have (on average 1.8933333333333333) internal successors, (1278), 1109 states have internal predecessors, (1278), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:42:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1297 transitions. [2023-11-29 02:42:54,192 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1297 transitions. Word has length 74 [2023-11-29 02:42:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:42:54,192 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1297 transitions. [2023-11-29 02:42:54,192 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 02:42:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1297 transitions. [2023-11-29 02:42:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 02:42:54,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:42:54,193 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 02:42:54,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:42:54,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:54,394 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:42:54,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:42:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1402692408, now seen corresponding path program 4 times [2023-11-29 02:42:54,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:42:54,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306044187] [2023-11-29 02:42:54,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:42:54,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:42:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:42:54,396 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:42:54,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 02:42:54,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:42:54,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:42:54,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:42:54,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:42:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:55,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:42:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:42:56,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:42:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306044187] [2023-11-29 02:42:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306044187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:42:56,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:42:56,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:42:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095241052] [2023-11-29 02:42:56,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:42:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:42:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:42:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:42:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:42:56,826 INFO L87 Difference]: Start difference. First operand 1117 states and 1297 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 02:43:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:43:13,731 INFO L93 Difference]: Finished difference Result 1174 states and 1386 transitions. [2023-11-29 02:43:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:43:13,732 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 02:43:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:43:13,736 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 02:43:13,736 INFO L226 Difference]: Without dead ends: 1172 [2023-11-29 02:43:13,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:43:13,741 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 47 mSDsluCounter, 23794 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24645 SdHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:43:13,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24645 Invalid, 5496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 5452 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 02:43:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-29 02:43:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1151. [2023-11-29 02:43:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 709 states have (on average 1.8674188998589563) internal successors, (1324), 1143 states have internal predecessors, (1324), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:43:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1343 transitions. [2023-11-29 02:43:13,783 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1343 transitions. Word has length 86 [2023-11-29 02:43:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:43:13,784 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1343 transitions. [2023-11-29 02:43:13,784 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 02:43:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1343 transitions. [2023-11-29 02:43:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:43:13,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:43:13,786 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 02:43:13,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:43:13,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:43:13,991 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:43:13,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:43:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1887156536, now seen corresponding path program 5 times [2023-11-29 02:43:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:43:13,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658537795] [2023-11-29 02:43:13,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:43:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:43:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:43:13,994 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:43:13,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:43:15,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:43:15,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:43:15,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 02:43:15,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:43:15,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:43:15,488 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:43:15,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:43:15,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:43:15,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:43:16,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:43:16,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:43:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:43:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:43:16,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:43:21,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:43:21,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658537795] [2023-11-29 02:43:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658537795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:43:21,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2029890306] [2023-11-29 02:43:21,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:43:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:43:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:43:21,164 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:43:21,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 02:44:27,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:44:27,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:44:27,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 02:44:27,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:27,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:44:27,617 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:44:27,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:44:27,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:44:27,830 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 02:44:28,806 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:44:28,807 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 02:44:28,908 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 02:44:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:44:28,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:44:29,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:44:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2029890306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:29,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:44:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 02:44:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74036397] [2023-11-29 02:44:29,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:44:29,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:44:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:44:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:44:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2023-11-29 02:44:29,326 INFO L87 Difference]: Start difference. First operand 1151 states and 1343 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 02:44:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:44:40,457 INFO L93 Difference]: Finished difference Result 1504 states and 1812 transitions. [2023-11-29 02:44:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:44:40,458 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 02:44:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:44:40,461 INFO L225 Difference]: With dead ends: 1504 [2023-11-29 02:44:40,461 INFO L226 Difference]: Without dead ends: 1502 [2023-11-29 02:44:40,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=210, Unknown=2, NotChecked=30, Total=306 [2023-11-29 02:44:40,462 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 652 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 4059 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 4066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:44:40,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 3751 Invalid, 4066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4059 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-11-29 02:44:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2023-11-29 02:44:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1150. [2023-11-29 02:44:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 709 states have (on average 1.8603667136812412) internal successors, (1319), 1142 states have internal predecessors, (1319), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:44:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1338 transitions. [2023-11-29 02:44:40,481 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1338 transitions. Word has length 108 [2023-11-29 02:44:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:44:40,481 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1338 transitions. [2023-11-29 02:44:40,482 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 02:44:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1338 transitions. [2023-11-29 02:44:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:44:40,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:44:40,483 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 02:44:40,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 02:44:40,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:44:40,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:44:40,884 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:44:40,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:44:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1887156537, now seen corresponding path program 1 times [2023-11-29 02:44:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:44:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991114661] [2023-11-29 02:44:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:40,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:44:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:44:40,886 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:44:40,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:44:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:44:41,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 02:44:41,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:44:41,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:44:41,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:44:41,821 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:44:41,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:44:41,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:44:41,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:44:41,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:44:41,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:44:42,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:44:42,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:44:42,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:44:42,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:44:42,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:44:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:44:43,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:44:44,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3037 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3038) |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_3037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3038 (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_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 02:44:44,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:44:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991114661] [2023-11-29 02:44:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991114661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:44:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [105167916] [2023-11-29 02:44:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:44:44,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:44:44,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:44:44,625 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:44:44,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 02:46:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:34,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:46:34,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:34,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:46:34,450 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:46:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:46:34,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:46:34,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:46:34,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:46:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:46:34,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:46:35,312 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:46:35,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:46:35,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 02:46:35,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:46:35,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:46:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:46:35,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:36,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3591) |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_3590) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3591 (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_3591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 02:46:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [105167916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:36,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:46:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 02:46:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262097473] [2023-11-29 02:46:36,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:46:36,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:46:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:46:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:46:36,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:46:36,698 INFO L87 Difference]: Start difference. First operand 1150 states and 1338 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 02:46:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:46:47,874 INFO L93 Difference]: Finished difference Result 1501 states and 1807 transitions. [2023-11-29 02:46:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:46:47,875 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 02:46:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:46:47,878 INFO L225 Difference]: With dead ends: 1501 [2023-11-29 02:46:47,878 INFO L226 Difference]: Without dead ends: 1501 [2023-11-29 02:46:47,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 02:46:47,879 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 654 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 4923 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 4933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:46:47,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 2978 Invalid, 4933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4923 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 02:46:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2023-11-29 02:46:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1149. [2023-11-29 02:46:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 709 states have (on average 1.8589562764456982) internal successors, (1318), 1141 states have internal predecessors, (1318), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:46:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1337 transitions. [2023-11-29 02:46:47,897 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1337 transitions. Word has length 108 [2023-11-29 02:46:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:46:47,897 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1337 transitions. [2023-11-29 02:46:47,897 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 02:46:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1337 transitions. [2023-11-29 02:46:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:46:47,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:46:47,898 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 02:46:47,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:46:48,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-11-29 02:46:48,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:46:48,299 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:46:48,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:46:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1082904316, now seen corresponding path program 1 times [2023-11-29 02:46:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:46:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764843926] [2023-11-29 02:46:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:46:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:46:48,301 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:46:48,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:46:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:49,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:46:49,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:49,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:46:49,239 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:46:49,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:46:49,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:46:49,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:46:50,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:46:50,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:46:50,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:46:50,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:46:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:46:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:46:50,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:46:54,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4014 (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_4014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:46:54,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4014 (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_4060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4014)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:46:54,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:46:54,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764843926] [2023-11-29 02:46:54,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764843926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:46:54,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1773951508] [2023-11-29 02:46:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:46:54,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:46:54,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:46:54,846 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:46:54,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 02:46:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:46:58,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 02:46:58,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:46:58,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:46:59,015 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:46:59,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:46:59,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:46:59,284 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 02:47:00,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:00,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 36 treesize of output 35 [2023-11-29 02:47:00,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:00,263 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 02:47:00,278 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 02:47:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:00,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:04,767 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4530 (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_4530))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4014)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:47:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1773951508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:04,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:47:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:47:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198090849] [2023-11-29 02:47:04,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:47:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:47:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:47:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:47:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=242, Unknown=4, NotChecked=102, Total=420 [2023-11-29 02:47:04,772 INFO L87 Difference]: Start difference. First operand 1149 states and 1337 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 02:47:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:47:15,428 INFO L93 Difference]: Finished difference Result 1500 states and 1806 transitions. [2023-11-29 02:47:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:47:15,429 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 02:47:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:47:15,431 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 02:47:15,431 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 02:47:15,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=81, Invalid=269, Unknown=4, NotChecked=108, Total=462 [2023-11-29 02:47:15,432 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 647 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 4174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 4180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:47:15,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 3754 Invalid, 4180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4174 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-11-29 02:47:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 02:47:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1148. [2023-11-29 02:47:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 709 states have (on average 1.8575458392101551) internal successors, (1317), 1140 states have internal predecessors, (1317), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:47:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1336 transitions. [2023-11-29 02:47:15,450 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1336 transitions. Word has length 110 [2023-11-29 02:47:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:47:15,450 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1336 transitions. [2023-11-29 02:47:15,450 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 02:47:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1336 transitions. [2023-11-29 02:47:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:47:15,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:47:15,452 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 02:47:15,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:47:15,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 02:47:15,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:15,852 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:47:15,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1082904317, now seen corresponding path program 1 times [2023-11-29 02:47:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:47:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689974733] [2023-11-29 02:47:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:47:15,854 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:47:15,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:47:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:16,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:47:16,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:47:16,803 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:47:16,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:47:16,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:47:16,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:47:16,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:47:16,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:47:16,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:47:17,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:17,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 62 treesize of output 57 [2023-11-29 02:47:17,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:47:17,826 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:17,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:47:17,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:47:17,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:47:17,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:47:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:17,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:18,034 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4999) |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~mem40#1.base| v_ArrVal_4998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4999 (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_4999) |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 02:47:18,072 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_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 02:47:19,400 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (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_5091) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5090))) (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_5091) .cse2 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:47:19,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:47:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689974733] [2023-11-29 02:47:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689974733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1997243402] [2023-11-29 02:47:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:19,409 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:47:19,410 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:47:19,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 02:47:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:23,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 02:47:23,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:23,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:47:23,702 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:47:23,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:47:23,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:47:23,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:47:23,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:47:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:47:23,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:47:24,603 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:24,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:47:24,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:47:24,811 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:47:24,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:47:24,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:47:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:47:24,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:47:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:24,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:24,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5559 (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_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (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_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:47:24,936 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_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 02:47:26,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5651 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5652))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5651) .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5651 (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_5651) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 02:47:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1997243402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:26,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:47:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:47:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777753242] [2023-11-29 02:47:26,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:47:26,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:47:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:47:26,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:47:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 02:47:26,314 INFO L87 Difference]: Start difference. First operand 1148 states and 1336 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 02:47:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:47:36,464 INFO L93 Difference]: Finished difference Result 1499 states and 1805 transitions. [2023-11-29 02:47:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:47:36,465 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 02:47:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:47:36,467 INFO L225 Difference]: With dead ends: 1499 [2023-11-29 02:47:36,467 INFO L226 Difference]: Without dead ends: 1499 [2023-11-29 02:47:36,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 02:47:36,468 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 1242 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 3984 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:47:36,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 2410 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3984 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 02:47:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2023-11-29 02:47:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1147. [2023-11-29 02:47:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 709 states have (on average 1.8561354019746121) internal successors, (1316), 1139 states have internal predecessors, (1316), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:47:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1335 transitions. [2023-11-29 02:47:36,486 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1335 transitions. Word has length 110 [2023-11-29 02:47:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:47:36,486 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1335 transitions. [2023-11-29 02:47:36,486 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 02:47:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1335 transitions. [2023-11-29 02:47:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 02:47:36,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:47:36,488 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 02:47:36,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:47:36,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 02:47:36,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:36,891 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:47:36,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1290629595, now seen corresponding path program 1 times [2023-11-29 02:47:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:47:36,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255105390] [2023-11-29 02:47:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:47:36,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:47:36,893 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:47:36,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:47:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:37,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:47:37,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:47:37,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:47:37,979 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:47:37,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:47:38,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:47:38,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:47:39,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:39,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:47:39,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:39,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:47:39,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:47:39,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:47:39,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:47:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:47:39,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:47:43,533 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (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_6091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:47:43,554 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (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~mem40#1.base| v_ArrVal_6090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:47:43,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (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_6090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:47:43,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (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_6137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:47:43,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:47:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255105390] [2023-11-29 02:47:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255105390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:47:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734415411] [2023-11-29 02:47:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:43,962 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:47:43,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:47:43,963 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:47:43,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 02:48:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:00,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 02:48:00,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:00,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:48:00,907 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:48:00,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:48:00,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:48:01,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 02:48:02,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:02,047 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 02:48:02,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:02,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:48:02,356 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:02,356 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 02:48:02,370 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 02:48:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:48:02,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:48:06,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (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~mem40#1.base| v_ArrVal_6576))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:48:06,481 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (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_6576))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:48:06,908 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6623))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:48:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1734415411] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:48:06,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:48:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 02:48:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243399488] [2023-11-29 02:48:06,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:48:06,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:48:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:06,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:48:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=306, Unknown=9, NotChecked=294, Total=702 [2023-11-29 02:48:06,914 INFO L87 Difference]: Start difference. First operand 1147 states and 1335 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 02:48:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:48:17,869 INFO L93 Difference]: Finished difference Result 1498 states and 1804 transitions. [2023-11-29 02:48:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:48:17,869 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 02:48:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:48:17,871 INFO L225 Difference]: With dead ends: 1498 [2023-11-29 02:48:17,871 INFO L226 Difference]: Without dead ends: 1498 [2023-11-29 02:48:17,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=102, Invalid=337, Unknown=9, NotChecked=308, Total=756 [2023-11-29 02:48:17,872 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 1215 mSDsluCounter, 4017 mSDsCounter, 0 mSdLazyCounter, 5083 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 4580 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:48:17,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 4580 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5083 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-11-29 02:48:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2023-11-29 02:48:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1146. [2023-11-29 02:48:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 709 states have (on average 1.8547249647390691) internal successors, (1315), 1138 states have internal predecessors, (1315), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:48:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1334 transitions. [2023-11-29 02:48:17,883 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1334 transitions. Word has length 112 [2023-11-29 02:48:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:48:17,883 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1334 transitions. [2023-11-29 02:48:17,883 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 02:48:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1334 transitions. [2023-11-29 02:48:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 02:48:17,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:48:17,884 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 02:48:17,893 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 02:48:18,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-11-29 02:48:18,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:48:18,285 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:48:18,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1290629596, now seen corresponding path program 1 times [2023-11-29 02:48:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:18,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85597207] [2023-11-29 02:48:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:48:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:18,287 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:48:18,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:48:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:19,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 02:48:19,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:19,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:48:19,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:48:19,396 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:48:19,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:48:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:48:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:48:19,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:48:19,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:48:20,220 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:20,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:48:20,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:48:20,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:20,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:48:20,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:48:20,473 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:48:20,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:48:20,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:48:20,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:48:20,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:48:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:48:20,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:48:20,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 02:48:20,716 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_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7109) |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_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:48:20,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (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_7107) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7106))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7107) .cse2 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:48:20,951 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_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7107) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7106))) (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_7107) .cse3 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:48:24,423 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7201 (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_7200))) (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_7201) .cse1 v_ArrVal_7107) (select (select (store .cse2 .cse1 v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7109))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7200))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7106))) (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_7201) .cse4 v_ArrVal_7107) .cse5 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:48:24,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85597207] [2023-11-29 02:48:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85597207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:48:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1554955661] [2023-11-29 02:48:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:24,440 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:48:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:48:24,441 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:48:24,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 02:48:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:41,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 02:48:41,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:41,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:48:41,680 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:48:41,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:48:41,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:48:41,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:48:41,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:48:42,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:48:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:48:43,192 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:43,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 02:48:43,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:48:43,490 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:43,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:48:43,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:48:43,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:48:43,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:48:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:48:43,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:48:43,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:48:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:48:43,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:48:43,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7686) |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~mem41#1.base| v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:48:43,890 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_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7686) |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_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:48:43,955 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7685))) (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~mem40#1.base| v_ArrVal_7684) .cse0 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7684) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 02:48:44,035 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_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7685))) (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_7684) .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7684) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7686) |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 02:48:46,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7778))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7685))) (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~mem38#1.base| v_ArrVal_7779) .cse0 v_ArrVal_7684) .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7778))) (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~mem38#1.base| v_ArrVal_7779) .cse6 v_ArrVal_7684) (select (select (store .cse7 .cse6 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7686))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 02:48:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1554955661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:48:46,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:48:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 02:48:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132240212] [2023-11-29 02:48:46,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:48:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:48:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:48:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 02:48:46,586 INFO L87 Difference]: Start difference. First operand 1146 states and 1334 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 02:49:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:49:07,048 INFO L93 Difference]: Finished difference Result 1497 states and 1803 transitions. [2023-11-29 02:49:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:49:07,049 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 02:49:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:49:07,051 INFO L225 Difference]: With dead ends: 1497 [2023-11-29 02:49:07,051 INFO L226 Difference]: Without dead ends: 1497 [2023-11-29 02:49:07,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 02:49:07,052 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 1232 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 5282 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:49:07,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 3028 Invalid, 5298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5282 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2023-11-29 02:49:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2023-11-29 02:49:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1145. [2023-11-29 02:49:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 709 states have (on average 1.853314527503526) internal successors, (1314), 1137 states have internal predecessors, (1314), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:49:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1333 transitions. [2023-11-29 02:49:07,064 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1333 transitions. Word has length 112 [2023-11-29 02:49:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:49:07,064 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1333 transitions. [2023-11-29 02:49:07,065 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 02:49:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1333 transitions. [2023-11-29 02:49:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 02:49:07,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:49:07,065 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 02:49:07,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 02:49:07,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:49:07,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:07,466 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:49:07,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash -948845740, now seen corresponding path program 1 times [2023-11-29 02:49:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:07,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009014145] [2023-11-29 02:49:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:07,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:07,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:07,468 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:49:07,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:49:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:08,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 02:49:08,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:08,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:49:08,894 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:49:08,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:49:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:49:09,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:49:10,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:10,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:49:10,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:10,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:49:10,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:10,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 44 treesize of output 43 [2023-11-29 02:49:11,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:49:11,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:49:11,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:49:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:49:11,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:49:15,418 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (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_8234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:49:15,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (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~mem41#1.base| v_ArrVal_8233))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:49:15,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (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_8233))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:15,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (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~mem40#1.base| v_ArrVal_8232))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:15,515 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (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_8232))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:49:16,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8280))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:16,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009014145] [2023-11-29 02:49:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009014145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:49:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642596616] [2023-11-29 02:49:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:16,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:49:16,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:49:16,038 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:49:16,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 02:49:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:35,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 02:49:35,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:49:36,608 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:49:36,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:49:36,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:49:37,034 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 02:49:38,400 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:49:38,401 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 02:49:38,705 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:49:38,706 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 02:49:38,904 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:49:38,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:49:39,088 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:49:39,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 02:49:39,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 02:49:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:49:39,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:49:39,161 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8736) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:49:39,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 02:49:39,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (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~mem41#1.base| v_ArrVal_8735))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:49:39,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (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~mem40#1.base| v_ArrVal_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:39,402 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (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_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:49:39,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8782))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8734)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:49:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [642596616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:49:39,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:49:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 02:49:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11542680] [2023-11-29 02:49:39,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:49:39,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 02:49:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 02:49:39,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=410, Unknown=16, NotChecked=636, Total=1190 [2023-11-29 02:49:39,955 INFO L87 Difference]: Start difference. First operand 1145 states and 1333 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 02:50:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:50:03,321 INFO L93 Difference]: Finished difference Result 1496 states and 1802 transitions. [2023-11-29 02:50:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:50:03,322 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 02:50:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:50:03,324 INFO L225 Difference]: With dead ends: 1496 [2023-11-29 02:50:03,324 INFO L226 Difference]: Without dead ends: 1496 [2023-11-29 02:50:03,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=138, Invalid=446, Unknown=16, NotChecked=660, Total=1260 [2023-11-29 02:50:03,325 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 1207 mSDsluCounter, 5085 mSDsCounter, 0 mSdLazyCounter, 6409 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 5647 SdHoareTripleChecker+Invalid, 6421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 6409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:50:03,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 5647 Invalid, 6421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 6409 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2023-11-29 02:50:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2023-11-29 02:50:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1144. [2023-11-29 02:50:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 709 states have (on average 1.851904090267983) internal successors, (1313), 1136 states have internal predecessors, (1313), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:50:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1332 transitions. [2023-11-29 02:50:03,337 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1332 transitions. Word has length 114 [2023-11-29 02:50:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:50:03,337 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1332 transitions. [2023-11-29 02:50:03,337 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 02:50:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1332 transitions. [2023-11-29 02:50:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 02:50:03,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:50:03,338 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 02:50:03,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 02:50:03,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:50:03,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:03,739 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:50:03,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -948845739, now seen corresponding path program 1 times [2023-11-29 02:50:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:50:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917808977] [2023-11-29 02:50:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:03,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:50:03,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:50:03,741 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:50:03,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:50:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:04,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 02:50:04,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:50:05,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:50:05,186 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:50:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:50:05,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:50:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:50:05,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:50:05,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:50:06,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:06,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:50:06,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:50:06,858 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:06,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:50:06,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:50:07,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:07,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:50:07,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:50:07,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:50:07,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:50:07,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:50:07,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 31 treesize of output 13 [2023-11-29 02:50:07,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:50:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:50:07,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:50:07,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9284) |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~mem42#1.base| v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:50:07,652 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_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9284) |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_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9284) |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 02:50:07,718 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9283))) (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~mem41#1.base| v_ArrVal_9282) .cse0 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9282) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 02:50:10,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9280))) (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~mem40#1.base| v_ArrVal_9281) .cse1 v_ArrVal_9282) (select (select (store .cse2 .cse1 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9280))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9283))) (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~mem40#1.base| v_ArrVal_9281) .cse4 v_ArrVal_9282) .cse5 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:50:10,811 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_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9280))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9283))) (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_9281) .cse1 v_ArrVal_9282) .cse2 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9280))) (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_9281) .cse7 v_ArrVal_9282) (select (select (store .cse8 .cse7 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))) |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 02:50:16,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9376))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9280))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9283))) (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~mem38#1.base| v_ArrVal_9377) .cse0 v_ArrVal_9281) .cse1 v_ArrVal_9282) .cse2 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9376))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9280))) (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~mem38#1.base| v_ArrVal_9377) .cse8 v_ArrVal_9281) .cse9 v_ArrVal_9282) (select (select (store .cse10 .cse9 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 02:50:16,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:50:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917808977] [2023-11-29 02:50:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917808977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:50:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [460679545] [2023-11-29 02:50:16,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:16,556 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:50:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:50:16,557 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:50:16,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 02:50:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:39,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 02:50:39,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:50:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:50:40,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:50:40,836 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:50:40,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:50:41,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:50:41,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:50:41,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:50:41,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:50:43,061 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:43,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:43,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:43,490 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:43,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:43,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:43,776 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:43,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:43,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:44,075 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:50:44,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:50:44,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:50:44,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:50:44,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:50:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:50:44,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:50:44,251 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9879) |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~mem42#1.base| v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 02:50:44,315 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_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9879) |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_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9879) |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 02:50:44,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9878))) (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~mem41#1.base| v_ArrVal_9877) .cse0 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9877) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 02:50:44,508 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_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9877) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9878))) (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_9877) .cse3 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:50:44,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9875))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9878))) (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~mem40#1.base| v_ArrVal_9876) .cse0 v_ArrVal_9877) .cse1 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9875))) (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~mem40#1.base| v_ArrVal_9876) .cse6 v_ArrVal_9877) (select (select (store .cse7 .cse6 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9879))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 02:50:46,099 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_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9875))) (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_9876) .cse2 v_ArrVal_9877) (select (select (store .cse3 .cse2 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9879))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9875))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9878))) (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_9876) .cse5 v_ArrVal_9877) .cse6 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 02:50:52,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (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_9971))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9875))) (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_9972) .cse1 v_ArrVal_9876) .cse2 v_ArrVal_9877) (select (select (store .cse3 .cse2 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9879))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9971))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9875))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9878))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9972) .cse6 v_ArrVal_9876) .cse7 v_ArrVal_9877) .cse8 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 02:50:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [460679545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:50:52,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:50:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 02:50:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400754370] [2023-11-29 02:50:52,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:50:52,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 02:50:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:50:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 02:50:52,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=388, Unknown=18, NotChecked=676, Total=1190 [2023-11-29 02:50:52,601 INFO L87 Difference]: Start difference. First operand 1144 states and 1332 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 02:52:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:25,240 INFO L93 Difference]: Finished difference Result 1495 states and 1801 transitions. [2023-11-29 02:52:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:52:25,242 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 02:52:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:25,244 INFO L225 Difference]: With dead ends: 1495 [2023-11-29 02:52:25,244 INFO L226 Difference]: Without dead ends: 1495 [2023-11-29 02:52:25,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=177, Invalid=669, Unknown=18, NotChecked=858, Total=1722 [2023-11-29 02:52:25,245 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 645 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 8153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 8162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:25,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 4502 Invalid, 8162 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 8153 Invalid, 0 Unknown, 0 Unchecked, 90.7s Time] [2023-11-29 02:52:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2023-11-29 02:52:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1143. [2023-11-29 02:52:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 709 states have (on average 1.85049365303244) internal successors, (1312), 1135 states have internal predecessors, (1312), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:52:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1331 transitions. [2023-11-29 02:52:25,258 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1331 transitions. Word has length 114 [2023-11-29 02:52:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:25,258 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1331 transitions. [2023-11-29 02:52:25,258 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 02:52:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1331 transitions. [2023-11-29 02:52:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 02:52:25,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:25,259 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 02:52:25,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 02:52:25,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:52:25,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:25,660 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:52:25,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1305978949, now seen corresponding path program 1 times [2023-11-29 02:52:25,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:25,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517204639] [2023-11-29 02:52:25,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:25,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:25,662 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:52:25,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:52:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:27,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 02:52:27,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:27,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:52:28,364 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:52:28,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:52:28,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:52:29,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:52:34,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:52:34,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:52:34,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:52:34,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:52:35,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:52:35,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:52:35,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:52:35,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:52:36,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:52:36,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:52:36,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:52:36,802 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 02:52:36,802 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 02:52:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:52:37,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:52:37,754 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10445) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 02:52:37,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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_10445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:52:37,869 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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~mem42#1.base| v_ArrVal_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:52:37,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:52:37,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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~mem41#1.base| v_ArrVal_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:52:38,063 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:52:38,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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~mem40#1.base| v_ArrVal_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:52:38,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:52:39,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#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~mem38#1.base| v_ArrVal_10492))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:52:39,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517204639] [2023-11-29 02:52:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517204639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:52:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [664602840] [2023-11-29 02:52:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:52:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:52:39,675 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:52:39,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 02:52:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:49,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 02:52:49,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:49,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:52:52,399 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:52:52,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:52:52,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:52:53,904 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 02:53:00,449 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:00,450 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 02:53:01,485 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:01,485 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 02:53:02,229 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:02,230 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 02:53:02,985 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:02,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 36 treesize of output 35 [2023-11-29 02:53:03,804 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:53:03,805 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 02:53:04,242 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-29 02:53:04,242 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 32 treesize of output 44 [2023-11-29 02:53:04,265 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 02:53:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:53:04,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:09,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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_10966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))))) is different from false [2023-11-29 02:53:09,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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~mem42#1.base| v_ArrVal_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)))) is different from false [2023-11-29 02:53:09,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 02:53:09,877 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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~mem41#1.base| v_ArrVal_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 02:53:09,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 02:53:10,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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~mem40#1.base| v_ArrVal_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 02:53:10,162 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (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_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 02:53:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [664602840] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:12,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 02:53:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452016803] [2023-11-29 02:53:12,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 02:53:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 02:53:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=633, Unknown=23, NotChecked=1072, Total=1892 [2023-11-29 02:53:12,231 INFO L87 Difference]: Start difference. First operand 1143 states and 1331 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 02:54:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:13,995 INFO L93 Difference]: Finished difference Result 1494 states and 1800 transitions. [2023-11-29 02:54:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:54:13,996 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 02:54:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:14,000 INFO L225 Difference]: With dead ends: 1494 [2023-11-29 02:54:14,000 INFO L226 Difference]: Without dead ends: 1494 [2023-11-29 02:54:14,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=174, Invalid=679, Unknown=23, NotChecked=1104, Total=1980 [2023-11-29 02:54:14,002 INFO L413 NwaCegarLoop]: 561 mSDtfsCounter, 1201 mSDsluCounter, 4304 mSDsCounter, 0 mSdLazyCounter, 5414 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 4865 SdHoareTripleChecker+Invalid, 5430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:14,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 4865 Invalid, 5430 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 5414 Invalid, 0 Unknown, 0 Unchecked, 61.2s Time] [2023-11-29 02:54:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2023-11-29 02:54:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1142. [2023-11-29 02:54:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 709 states have (on average 1.849083215796897) internal successors, (1311), 1134 states have internal predecessors, (1311), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 02:54:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1330 transitions. [2023-11-29 02:54:14,020 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1330 transitions. Word has length 116 [2023-11-29 02:54:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:14,020 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1330 transitions. [2023-11-29 02:54:14,021 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 02:54:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1330 transitions. [2023-11-29 02:54:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 02:54:14,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:14,022 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 02:54:14,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 02:54:14,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 02:54:14,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:54:14,427 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 02:54:14,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1305978948, now seen corresponding path program 1 times [2023-11-29 02:54:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:14,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838375814] [2023-11-29 02:54:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:14,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:54:14,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:14,430 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:54:14,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 02:54:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:15,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-29 02:54:15,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:15,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:54:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:54:17,267 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:54:17,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:54:17,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:54:17,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:54:18,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 02:54:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:54:25,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:25,913 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 02:54:25,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:54:26,797 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:26,797 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 02:54:26,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:54:27,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:27,471 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 02:54:27,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:54:28,198 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:28,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 75 treesize of output 68 [2023-11-29 02:54:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:54:28,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:28,910 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 02:54:28,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:54:29,080 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 02:54:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:54:29,117 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 02:54:29,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:54:29,363 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 02:54:29,363 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 02:54:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:54:29,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:31,673 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_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-29 02:54:31,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11533))) (let ((.cse0 (select (select .cse2 |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~mem42#1.base| v_ArrVal_11534) .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse2 .cse0 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11534) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:54:32,044 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_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11533))) (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_11534) .cse1 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse1 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11534) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-29 02:54:32,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11532))) (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~mem41#1.base| v_ArrVal_11531) .cse1 v_ArrVal_11534) (select (select (store .cse2 .cse1 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11535))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11532))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11533))) (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~mem41#1.base| v_ArrVal_11531) .cse4 v_ArrVal_11534) .cse5 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse6 .cse5 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:54:32,382 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 (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11532))) (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_11531) .cse2 v_ArrVal_11534) (select (select (store .cse3 .cse2 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11535))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11532))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11533))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11531) .cse5 v_ArrVal_11534) .cse6 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse7 .cse6 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 02:54:37,410 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11529))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11532))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11533))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11530) .cse0 v_ArrVal_11531) .cse1 v_ArrVal_11534) .cse2 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse4 .cse2 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11529))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11532))) (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~mem40#1.base| v_ArrVal_11530) .cse8 v_ArrVal_11531) .cse9 v_ArrVal_11534) (select (select (store .cse10 .cse9 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11535))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-11-29 02:54:37,721 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~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11529))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11532))) (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_11530) .cse2 v_ArrVal_11531) .cse3 v_ArrVal_11534) (select (select (store .cse4 .cse3 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11535))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11529))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11532))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11533))) (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_11530) .cse7 v_ArrVal_11531) .cse8 v_ArrVal_11534) .cse9 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse10 .cse9 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 02:54:44,116 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~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11628))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11529))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11532))) (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~mem38#1.base| v_ArrVal_11629) .cse1 v_ArrVal_11530) .cse2 v_ArrVal_11531) .cse3 v_ArrVal_11534) (select (select (store .cse4 .cse3 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11535))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11628))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11529))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11532))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11533))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11629) .cse8 v_ArrVal_11530) .cse9 v_ArrVal_11531) .cse10 v_ArrVal_11534) .cse11 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse12 .cse11 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:54:44,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838375814] [2023-11-29 02:54:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838375814] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [462262250] [2023-11-29 02:54:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:44,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:54:44,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:54:44,183 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:54:44,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fac65625-e766-47e3-8f7e-d8ff44606d6c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 02:54:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:57,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 02:54:57,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:57,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:55:02,100 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:55:02,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:55:02,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:55:03,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:55:03,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:55:05,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-29 02:55:05,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:55:19,763 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:19,763 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 61 treesize of output 54 [2023-11-29 02:55:19,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:55:22,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:22,465 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 61 treesize of output 54 [2023-11-29 02:55:22,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:55:24,202 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:24,203 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 61 treesize of output 54 [2023-11-29 02:55:24,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:55:25,902 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:25,902 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 61 treesize of output 54 [2023-11-29 02:55:25,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:55:27,577 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:27,577 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 61 treesize of output 54 [2023-11-29 02:55:27,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:55:27,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:55:27,907 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 18 treesize of output 13 [2023-11-29 02:55:27,952 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 36 treesize of output 20 [2023-11-29 02:55:27,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:55:28,393 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 02:55:28,393 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 02:55:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:55:28,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:55:31,614 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~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12149) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12150))) (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~mem42#1.base| v_ArrVal_12149) .cse2 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse2 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:55:31,918 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_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12150))) (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_12149) .cse1 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse1 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12149) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 02:55:32,188 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~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12148))) (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~mem41#1.base| v_ArrVal_12147) .cse1 v_ArrVal_12149) (select (select (store .cse2 .cse1 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11535))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12148))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12150))) (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~mem41#1.base| v_ArrVal_12147) .cse4 v_ArrVal_12149) .cse5 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse6 .cse5 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:55:36,662 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_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12148))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12150))) (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_12147) .cse1 v_ArrVal_12149) .cse2 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse4 .cse2 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12148))) (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_12147) .cse7 v_ArrVal_12149) (select (select (store .cse8 .cse7 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11535))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))))))) is different from false [2023-11-29 02:55:37,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12145))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12148))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12150))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12146) .cse0 v_ArrVal_12147) .cse1 v_ArrVal_12149) .cse2 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse4 .cse2 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12145))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12148))) (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~mem40#1.base| v_ArrVal_12146) .cse8 v_ArrVal_12147) .cse9 v_ArrVal_12149) (select (select (store .cse10 .cse9 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11535))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 02:55:37,395 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~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12145))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_12148))) (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_12146) .cse2 v_ArrVal_12147) .cse3 v_ArrVal_12149) (select (select (store .cse4 .cse3 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11535))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12145))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_12148))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12150))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12146) .cse7 v_ArrVal_12147) .cse8 v_ArrVal_12149) .cse9 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse10 .cse9 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 02:55:48,103 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12245))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_12145))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12148))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_12150))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12244) .cse0 v_ArrVal_12146) .cse1 v_ArrVal_12147) .cse2 v_ArrVal_12149) .cse3 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse5 .cse3 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12245))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_12145))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_12148))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12244) .cse10 v_ArrVal_12146) .cse11 v_ArrVal_12147) .cse12 v_ArrVal_12149) (select (select (store .cse13 .cse12 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11535))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd .cse9 (_ bv4 32)))))))) is different from false [2023-11-29 02:55:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [462262250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:55:48,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:55:48,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-11-29 02:55:48,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879698856] [2023-11-29 02:55:48,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:55:48,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:55:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:55:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:55:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=458, Unknown=19, NotChecked=870, Total=1482 [2023-11-29 02:55:48,178 INFO L87 Difference]: Start difference. First operand 1142 states and 1330 transitions. Second operand has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 21 states have internal predecessors, (136), 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)