./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:45:34,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:45:34,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:45:34,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:45:34,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:45:34,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:45:34,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:45:34,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:45:34,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:45:34,138 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:45:34,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:45:34,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:45:34,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:45:34,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:45:34,141 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:45:34,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:45:34,142 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:45:34,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:45:34,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:45:34,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:45:34,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:45:34,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:45:34,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:45:34,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:45:34,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:45:34,147 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:45:34,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:45:34,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:45:34,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:45:34,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:45:34,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:45:34,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:45:34,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:45:34,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:45:34,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:45:34,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:45:34,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:45:34,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:45:34,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:45:34,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:45:34,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:45:34,154 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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2023-11-29 05:45:34,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:45:34,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:45:34,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:45:34,406 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:45:34,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:45:34,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2023-11-29 05:45:37,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:45:37,479 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:45:37,479 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2023-11-29 05:45:37,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/bbac2c62c/432fee6942b74f08bdf27edd5ab81ce3/FLAG670e5afd2 [2023-11-29 05:45:37,512 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/bbac2c62c/432fee6942b74f08bdf27edd5ab81ce3 [2023-11-29 05:45:37,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:45:37,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:45:37,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:45:37,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:45:37,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:45:37,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:45:37" (1/1) ... [2023-11-29 05:45:37,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6e03d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:37, skipping insertion in model container [2023-11-29 05:45:37,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:45:37" (1/1) ... [2023-11-29 05:45:37,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:45:38,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:45:38,112 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 05:45:38,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@68c35c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:38, skipping insertion in model container [2023-11-29 05:45:38,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:45:38,113 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 05:45:38,115 INFO L158 Benchmark]: Toolchain (without parser) took 597.68ms. Allocated memory is still 132.1MB. Free memory was 95.0MB in the beginning and 73.3MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:45:38,116 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:45:38,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.17ms. Allocated memory is still 132.1MB. Free memory was 94.7MB in the beginning and 73.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:45:38,118 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.18ms. Allocated memory is still 132.1MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.17ms. Allocated memory is still 132.1MB. Free memory was 94.7MB in the beginning and 73.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:45:39,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:45:39,941 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:45:39,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:45:39,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:45:39,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:45:39,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:45:39,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:45:39,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:45:39,979 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:45:39,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:45:39,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:45:39,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:45:39,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:45:39,982 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:45:39,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:45:39,983 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:45:39,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:45:39,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:45:39,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:45:39,985 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:45:39,986 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:45:39,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:45:39,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:45:39,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:45:39,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:45:39,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:45:39,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:45:39,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:45:39,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:45:39,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:45:39,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:45:39,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:45:39,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:45:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:45:39,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:45:39,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:45:39,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:45:39,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:45:39,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:45:39,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:45:39,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:45:39,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:45:39,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:45:39,994 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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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_4b1544ce-de6f-4e65-ba19-3dc681234b89/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 -> 834766c90c3d5af368509ae691087999af545dba19d7eed6a5d75f823cbb2437 [2023-11-29 05:45:40,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:45:40,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:45:40,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:45:40,310 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:45:40,310 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:45:40,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2023-11-29 05:45:43,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:45:43,400 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:45:43,401 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-2.i [2023-11-29 05:45:43,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/c8d5e97a9/b39b0933e9d44db387a42ee4b8a7f191/FLAGe742a4a25 [2023-11-29 05:45:43,447 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/data/c8d5e97a9/b39b0933e9d44db387a42ee4b8a7f191 [2023-11-29 05:45:43,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:45:43,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:45:43,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:45:43,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:45:43,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:45:43,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:45:43" (1/1) ... [2023-11-29 05:45:43,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bccc34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:43, skipping insertion in model container [2023-11-29 05:45:43,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:45:43" (1/1) ... [2023-11-29 05:45:43,526 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:45:44,043 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:45:44,057 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 05:45:44,073 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:45:44,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:45:44,166 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:45:44,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:45:44,287 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:45:44,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44 WrapperNode [2023-11-29 05:45:44,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:45:44,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:45:44,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:45:44,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:45:44,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,395 INFO L138 Inliner]: procedures = 180, calls = 401, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1340 [2023-11-29 05:45:44,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:45:44,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:45:44,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:45:44,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:45:44,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,536 INFO L175 MemorySlicer]: Split 367 memory accesses to 4 slices as follows [5, 2, 5, 355]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 92 writes are split as follows [1, 0, 1, 90]. [2023-11-29 05:45:44,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:45:44,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:45:44,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:45:44,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:45:44,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (1/1) ... [2023-11-29 05:45:44,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:45:44,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:45:44,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:45:44,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:45:44,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 05:45:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 05:45:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 05:45:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 05:45:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:45:44,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:45:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:45:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 05:45:44,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:45:44,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:45:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 05:45:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 05:45:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 05:45:44,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 05:45:44,699 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 05:45:44,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 05:45:44,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 05:45:44,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 05:45:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:45:44,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:45:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:45:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:45:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:45:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:45:44,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:45:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:45:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:45:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:45:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:45:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:45:44,965 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:45:44,967 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:45:44,972 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:45:45,025 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:45:45,046 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:45:45,068 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:45:50,659 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:45:50,875 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:45:50,875 INFO L309 CfgBuilder]: Removed 69 assume(true) statements. [2023-11-29 05:45:50,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:45:50 BoogieIcfgContainer [2023-11-29 05:45:50,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:45:50,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:45:50,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:45:50,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:45:50,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:45:43" (1/3) ... [2023-11-29 05:45:50,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3843aba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:45:50, skipping insertion in model container [2023-11-29 05:45:50,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:45:44" (2/3) ... [2023-11-29 05:45:50,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3843aba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:45:50, skipping insertion in model container [2023-11-29 05:45:50,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:45:50" (3/3) ... [2023-11-29 05:45:50,885 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-2.i [2023-11-29 05:45:50,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:45:50,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2023-11-29 05:45:50,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:45:50,983 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;@479e650b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:45:50,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2023-11-29 05:45:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:45:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:45:50,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:50,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:45:50,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:45:51,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 71454806, now seen corresponding path program 1 times [2023-11-29 05:45:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:51,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104462178] [2023-11-29 05:45:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:51,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:51,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:51,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:51,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:45:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:51,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:45:51,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:45:51,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:45:51,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:51,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104462178] [2023-11-29 05:45:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104462178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421620843] [2023-11-29 05:45:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:51,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:45:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:51,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:45:51,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:45:51,304 INFO L87 Difference]: Start difference. First operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:52,281 INFO L93 Difference]: Finished difference Result 1321 states and 1404 transitions. [2023-11-29 05:45:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:45:52,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:45:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:52,310 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 05:45:52,310 INFO L226 Difference]: Without dead ends: 1320 [2023-11-29 05:45:52,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:45:52,314 INFO L413 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:52,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1261 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:45:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-11-29 05:45:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2023-11-29 05:45:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 565 states have (on average 2.426548672566372) internal successors, (1371), 1311 states have internal predecessors, (1371), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:45:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1403 transitions. [2023-11-29 05:45:52,405 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1403 transitions. Word has length 4 [2023-11-29 05:45:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:52,405 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1403 transitions. [2023-11-29 05:45:52,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1403 transitions. [2023-11-29 05:45:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:45:52,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:52,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:45:52,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:52,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:52,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:45:52,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash 71454868, now seen corresponding path program 1 times [2023-11-29 05:45:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:52,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936604578] [2023-11-29 05:45:52,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:52,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:52,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:52,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:52,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:45:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:52,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:45:52,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:52,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:45:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:45:52,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:45:52,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936604578] [2023-11-29 05:45:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936604578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:52,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:52,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779804856] [2023-11-29 05:45:52,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:52,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:52,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:52,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:52,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:52,817 INFO L87 Difference]: Start difference. First operand 1320 states and 1403 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:55,551 INFO L93 Difference]: Finished difference Result 1350 states and 1446 transitions. [2023-11-29 05:45:55,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:55,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:45:55,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:55,558 INFO L225 Difference]: With dead ends: 1350 [2023-11-29 05:45:55,558 INFO L226 Difference]: Without dead ends: 1350 [2023-11-29 05:45:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:55,559 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 1042 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:55,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 838 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 05:45:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-11-29 05:45:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1293. [2023-11-29 05:45:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 631 states have (on average 2.223454833597464) internal successors, (1403), 1284 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:45:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1435 transitions. [2023-11-29 05:45:55,588 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1435 transitions. Word has length 4 [2023-11-29 05:45:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:55,588 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1435 transitions. [2023-11-29 05:45:55,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1435 transitions. [2023-11-29 05:45:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:45:55,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:55,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:45:55,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:45:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:55,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:45:55,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 71454869, now seen corresponding path program 1 times [2023-11-29 05:45:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424978435] [2023-11-29 05:45:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:55,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:55,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:55,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:55,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:45:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:55,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:45:55,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:55,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:45:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:45:55,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:45:55,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424978435] [2023-11-29 05:45:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424978435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:45:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:45:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:45:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712390657] [2023-11-29 05:45:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:55,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:45:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:45:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:55,918 INFO L87 Difference]: Start difference. First operand 1293 states and 1435 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:59,822 INFO L93 Difference]: Finished difference Result 1565 states and 1727 transitions. [2023-11-29 05:45:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:45:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:45:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:59,831 INFO L225 Difference]: With dead ends: 1565 [2023-11-29 05:45:59,832 INFO L226 Difference]: Without dead ends: 1565 [2023-11-29 05:45:59,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:45:59,833 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 456 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:59,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1462 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 05:45:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-11-29 05:45:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1416. [2023-11-29 05:45:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 764 states have (on average 2.193717277486911) internal successors, (1676), 1407 states have internal predecessors, (1676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:45:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1708 transitions. [2023-11-29 05:45:59,876 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1708 transitions. Word has length 4 [2023-11-29 05:45:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:59,877 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1708 transitions. [2023-11-29 05:45:59,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:45:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1708 transitions. [2023-11-29 05:45:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:45:59,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:59,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:45:59,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:00,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:00,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:00,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:00,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2078175095, now seen corresponding path program 1 times [2023-11-29 05:46:00,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:00,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600572420] [2023-11-29 05:46:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:00,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:00,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:00,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:00,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:46:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:00,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:46:00,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:00,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:00,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:00,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600572420] [2023-11-29 05:46:00,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600572420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:00,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:00,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277695522] [2023-11-29 05:46:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:00,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:00,211 INFO L87 Difference]: Start difference. First operand 1416 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:02,048 INFO L93 Difference]: Finished difference Result 2605 states and 3158 transitions. [2023-11-29 05:46:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 05:46:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:02,066 INFO L225 Difference]: With dead ends: 2605 [2023-11-29 05:46:02,066 INFO L226 Difference]: Without dead ends: 2605 [2023-11-29 05:46:02,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:02,068 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 1029 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:02,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2710 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:46:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2023-11-29 05:46:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1417. [2023-11-29 05:46:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 765 states have (on average 2.1921568627450982) internal successors, (1677), 1408 states have internal predecessors, (1677), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1709 transitions. [2023-11-29 05:46:02,119 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1709 transitions. Word has length 5 [2023-11-29 05:46:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:02,119 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1709 transitions. [2023-11-29 05:46:02,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1709 transitions. [2023-11-29 05:46:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:46:02,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:02,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:02,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 05:46:02,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:02,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:02,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 9598878, now seen corresponding path program 1 times [2023-11-29 05:46:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229855985] [2023-11-29 05:46:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:02,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:02,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:02,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:46:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:02,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:46:02,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:02,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:02,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229855985] [2023-11-29 05:46:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229855985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419226290] [2023-11-29 05:46:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:02,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:02,538 INFO L87 Difference]: Start difference. First operand 1417 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:03,691 INFO L93 Difference]: Finished difference Result 1378 states and 1669 transitions. [2023-11-29 05:46:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 05:46:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:03,700 INFO L225 Difference]: With dead ends: 1378 [2023-11-29 05:46:03,701 INFO L226 Difference]: Without dead ends: 1378 [2023-11-29 05:46:03,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:03,702 INFO L413 NwaCegarLoop]: 1109 mSDtfsCounter, 70 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:03,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:46:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-29 05:46:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-11-29 05:46:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 750 states have (on average 2.1826666666666665) internal successors, (1637), 1369 states have internal predecessors, (1637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1669 transitions. [2023-11-29 05:46:03,726 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1669 transitions. Word has length 10 [2023-11-29 05:46:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:03,726 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1669 transitions. [2023-11-29 05:46:03,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1669 transitions. [2023-11-29 05:46:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:46:03,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:03,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:03,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:03,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:03,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:03,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 634583864, now seen corresponding path program 1 times [2023-11-29 05:46:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965280111] [2023-11-29 05:46:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:03,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:03,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:03,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:03,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:46:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:04,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:04,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:04,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:04,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965280111] [2023-11-29 05:46:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965280111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:04,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:04,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428796209] [2023-11-29 05:46:04,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:04,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:04,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:04,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:04,118 INFO L87 Difference]: Start difference. First operand 1378 states and 1669 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:05,554 INFO L93 Difference]: Finished difference Result 1364 states and 1648 transitions. [2023-11-29 05:46:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 05:46:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:05,562 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 05:46:05,563 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 05:46:05,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:05,564 INFO L413 NwaCegarLoop]: 1078 mSDtfsCounter, 58 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:05,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3210 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:46:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 05:46:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1363. [2023-11-29 05:46:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 749 states have (on average 2.156208277703605) internal successors, (1615), 1354 states have internal predecessors, (1615), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1647 transitions. [2023-11-29 05:46:05,594 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1647 transitions. Word has length 12 [2023-11-29 05:46:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:05,595 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 1647 transitions. [2023-11-29 05:46:05,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1647 transitions. [2023-11-29 05:46:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:46:05,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:05,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:05,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:46:05,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:05,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:05,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1624158822, now seen corresponding path program 1 times [2023-11-29 05:46:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872795375] [2023-11-29 05:46:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:05,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:05,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:05,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:46:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:05,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:05,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:05,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:06,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:06,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872795375] [2023-11-29 05:46:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872795375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893319163] [2023-11-29 05:46:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:06,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:06,006 INFO L87 Difference]: Start difference. First operand 1363 states and 1647 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:09,128 INFO L93 Difference]: Finished difference Result 1416 states and 1654 transitions. [2023-11-29 05:46:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 05:46:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:09,136 INFO L225 Difference]: With dead ends: 1416 [2023-11-29 05:46:09,136 INFO L226 Difference]: Without dead ends: 1416 [2023-11-29 05:46:09,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:09,137 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 977 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:09,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1267 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 05:46:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2023-11-29 05:46:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1359. [2023-11-29 05:46:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 749 states have (on average 2.15086782376502) internal successors, (1611), 1350 states have internal predecessors, (1611), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1643 transitions. [2023-11-29 05:46:09,168 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1643 transitions. Word has length 26 [2023-11-29 05:46:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:09,168 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1643 transitions. [2023-11-29 05:46:09,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1643 transitions. [2023-11-29 05:46:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:46:09,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:09,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:09,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:46:09,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:09,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:09,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1624158823, now seen corresponding path program 1 times [2023-11-29 05:46:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992261340] [2023-11-29 05:46:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:09,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:09,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:46:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:09,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:46:09,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:09,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:09,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:09,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992261340] [2023-11-29 05:46:09,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992261340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702477511] [2023-11-29 05:46:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:09,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:09,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:09,805 INFO L87 Difference]: Start difference. First operand 1359 states and 1643 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:14,618 INFO L93 Difference]: Finished difference Result 1504 states and 1658 transitions. [2023-11-29 05:46:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 05:46:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:14,624 INFO L225 Difference]: With dead ends: 1504 [2023-11-29 05:46:14,625 INFO L226 Difference]: Without dead ends: 1504 [2023-11-29 05:46:14,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:14,625 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 393 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:14,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1938 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 05:46:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2023-11-29 05:46:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1355. [2023-11-29 05:46:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 749 states have (on average 2.145527369826435) internal successors, (1607), 1346 states have internal predecessors, (1607), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1639 transitions. [2023-11-29 05:46:14,652 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1639 transitions. Word has length 26 [2023-11-29 05:46:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:14,653 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1639 transitions. [2023-11-29 05:46:14,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1639 transitions. [2023-11-29 05:46:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 05:46:14,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:14,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:14,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:46:14,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:14,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:14,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash 869234144, now seen corresponding path program 1 times [2023-11-29 05:46:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807152572] [2023-11-29 05:46:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:14,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:14,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 05:46:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:15,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:15,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:15,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807152572] [2023-11-29 05:46:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807152572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:15,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:15,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651467630] [2023-11-29 05:46:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:15,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:15,121 INFO L87 Difference]: Start difference. First operand 1355 states and 1639 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:16,375 INFO L93 Difference]: Finished difference Result 1349 states and 1629 transitions. [2023-11-29 05:46:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-29 05:46:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:16,382 INFO L225 Difference]: With dead ends: 1349 [2023-11-29 05:46:16,382 INFO L226 Difference]: Without dead ends: 1349 [2023-11-29 05:46:16,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:16,382 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 23 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:16,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3196 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:46:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-11-29 05:46:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2023-11-29 05:46:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 743 states have (on average 2.149394347240915) internal successors, (1597), 1340 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1629 transitions. [2023-11-29 05:46:16,400 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1629 transitions. Word has length 42 [2023-11-29 05:46:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:16,401 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1629 transitions. [2023-11-29 05:46:16,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1629 transitions. [2023-11-29 05:46:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 05:46:16,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:16,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:16,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:16,603 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:16,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash -132264064, now seen corresponding path program 1 times [2023-11-29 05:46:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508199589] [2023-11-29 05:46:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:16,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:16,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:16,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:16,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:46:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:16,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:17,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:17,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508199589] [2023-11-29 05:46:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508199589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:17,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:46:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907840223] [2023-11-29 05:46:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:17,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:46:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:46:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:17,096 INFO L87 Difference]: Start difference. First operand 1349 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:18,247 INFO L93 Difference]: Finished difference Result 1572 states and 1861 transitions. [2023-11-29 05:46:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:46:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-29 05:46:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:18,256 INFO L225 Difference]: With dead ends: 1572 [2023-11-29 05:46:18,256 INFO L226 Difference]: Without dead ends: 1572 [2023-11-29 05:46:18,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:46:18,257 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 246 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:18,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2112 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:46:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-11-29 05:46:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1392. [2023-11-29 05:46:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 786 states have (on average 2.0865139949109417) internal successors, (1640), 1383 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1672 transitions. [2023-11-29 05:46:18,285 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1672 transitions. Word has length 46 [2023-11-29 05:46:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:18,285 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1672 transitions. [2023-11-29 05:46:18,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1672 transitions. [2023-11-29 05:46:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:18,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:18,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:18,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:18,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:18,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:18,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1901175151, now seen corresponding path program 1 times [2023-11-29 05:46:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:18,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078934326] [2023-11-29 05:46:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:18,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:18,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:18,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:46:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:46:18,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:18,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:46:18,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:19,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:46:19,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 05:46:19,354 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:46:19,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:46:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:19,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:19,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078934326] [2023-11-29 05:46:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078934326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:19,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:46:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076633069] [2023-11-29 05:46:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:19,380 INFO L87 Difference]: Start difference. First operand 1392 states and 1672 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:22,793 INFO L93 Difference]: Finished difference Result 1364 states and 1598 transitions. [2023-11-29 05:46:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-29 05:46:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:22,799 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 05:46:22,799 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 05:46:22,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:22,799 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 943 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:22,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 702 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 05:46:22,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 05:46:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1175. [2023-11-29 05:46:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1304 transitions. [2023-11-29 05:46:22,816 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1304 transitions. Word has length 49 [2023-11-29 05:46:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:22,817 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1304 transitions. [2023-11-29 05:46:22,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1304 transitions. [2023-11-29 05:46:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:46:22,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:22,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:22,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:46:23,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:23,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:23,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash 798272896, now seen corresponding path program 1 times [2023-11-29 05:46:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111614917] [2023-11-29 05:46:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:23,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:23,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:46:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:46:23,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:23,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:46:23,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:46:23,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 05:46:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:23,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:23,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111614917] [2023-11-29 05:46:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111614917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549169891] [2023-11-29 05:46:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:23,318 INFO L87 Difference]: Start difference. First operand 1175 states and 1304 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:27,057 INFO L93 Difference]: Finished difference Result 1174 states and 1303 transitions. [2023-11-29 05:46:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 05:46:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:27,062 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 05:46:27,062 INFO L226 Difference]: Without dead ends: 1174 [2023-11-29 05:46:27,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:27,063 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 3 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:27,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2556 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 05:46:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-11-29 05:46:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2023-11-29 05:46:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 653 states have (on average 1.9464012251148546) internal successors, (1271), 1165 states have internal predecessors, (1271), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1303 transitions. [2023-11-29 05:46:27,083 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1303 transitions. Word has length 53 [2023-11-29 05:46:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:27,083 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 1303 transitions. [2023-11-29 05:46:27,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1303 transitions. [2023-11-29 05:46:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:46:27,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:27,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:27,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:46:27,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:27,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:27,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash 798272897, now seen corresponding path program 1 times [2023-11-29 05:46:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715222534] [2023-11-29 05:46:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:27,288 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:27,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:46:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:27,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:46:27,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:27,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 5 [2023-11-29 05:46:27,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:46:27,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 05:46:27,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 05:46:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:27,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:27,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:27,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715222534] [2023-11-29 05:46:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715222534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:27,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:27,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954029729] [2023-11-29 05:46:27,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:27,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:27,613 INFO L87 Difference]: Start difference. First operand 1174 states and 1303 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:32,260 INFO L93 Difference]: Finished difference Result 1173 states and 1302 transitions. [2023-11-29 05:46:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:32,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 05:46:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:32,267 INFO L225 Difference]: With dead ends: 1173 [2023-11-29 05:46:32,267 INFO L226 Difference]: Without dead ends: 1173 [2023-11-29 05:46:32,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:32,268 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 1 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:32,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2593 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 05:46:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-11-29 05:46:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2023-11-29 05:46:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 652 states have (on average 1.9478527607361964) internal successors, (1270), 1164 states have internal predecessors, (1270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:46:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1302 transitions. [2023-11-29 05:46:32,285 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1302 transitions. Word has length 53 [2023-11-29 05:46:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:32,285 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1302 transitions. [2023-11-29 05:46:32,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:46:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1302 transitions. [2023-11-29 05:46:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:46:32,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:32,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:32,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 05:46:32,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:32,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:32,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash 846185892, now seen corresponding path program 1 times [2023-11-29 05:46:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:32,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632413374] [2023-11-29 05:46:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:32,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:32,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:32,489 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:32,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 05:46:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:32,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:46:32,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:32,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:46:32,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632413374] [2023-11-29 05:46:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632413374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353311090] [2023-11-29 05:46:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:46:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:32,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:46:32,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:46:32,771 INFO L87 Difference]: Start difference. First operand 1173 states and 1302 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:46:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:34,016 INFO L93 Difference]: Finished difference Result 1175 states and 1306 transitions. [2023-11-29 05:46:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:46:34,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-29 05:46:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:34,023 INFO L225 Difference]: With dead ends: 1175 [2023-11-29 05:46:34,023 INFO L226 Difference]: Without dead ends: 1175 [2023-11-29 05:46:34,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:34,024 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:34,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2991 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:46:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-11-29 05:46:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2023-11-29 05:46:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:46:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1306 transitions. [2023-11-29 05:46:34,045 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1306 transitions. Word has length 59 [2023-11-29 05:46:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:34,045 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1306 transitions. [2023-11-29 05:46:34,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:46:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1306 transitions. [2023-11-29 05:46:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 05:46:34,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:34,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:34,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 05:46:34,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:34,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:34,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash 960552479, now seen corresponding path program 1 times [2023-11-29 05:46:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:34,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571340014] [2023-11-29 05:46:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:34,250 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:34,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:46:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:34,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:46:34,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:34,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:34,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:34,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571340014] [2023-11-29 05:46:34,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571340014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:34,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:34,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 05:46:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165753292] [2023-11-29 05:46:34,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:34,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:46:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:46:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:34,622 INFO L87 Difference]: Start difference. First operand 1175 states and 1306 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:36,135 INFO L93 Difference]: Finished difference Result 1184 states and 1321 transitions. [2023-11-29 05:46:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:46:36,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-11-29 05:46:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:36,141 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 05:46:36,141 INFO L226 Difference]: Without dead ends: 1184 [2023-11-29 05:46:36,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:46:36,142 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 7 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:36,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2987 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:46:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-11-29 05:46:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1183. [2023-11-29 05:46:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 660 states have (on average 1.946969696969697) internal successors, (1285), 1173 states have internal predecessors, (1285), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:46:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1319 transitions. [2023-11-29 05:46:36,172 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1319 transitions. Word has length 60 [2023-11-29 05:46:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:36,172 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1319 transitions. [2023-11-29 05:46:36,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1319 transitions. [2023-11-29 05:46:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 05:46:36,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:36,173 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:36,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:36,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:36,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:36,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:36,374 INFO L85 PathProgramCache]: Analyzing trace with hash -365982620, now seen corresponding path program 2 times [2023-11-29 05:46:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794973987] [2023-11-29 05:46:36,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:46:36,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:36,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:36,376 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:36,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 05:46:36,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:46:36,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:46:36,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:46:36,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:36,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:36,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794973987] [2023-11-29 05:46:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794973987] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:36,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 05:46:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644765132] [2023-11-29 05:46:36,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:36,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:46:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:46:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:46:36,978 INFO L87 Difference]: Start difference. First operand 1183 states and 1319 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:39,844 INFO L93 Difference]: Finished difference Result 1198 states and 1345 transitions. [2023-11-29 05:46:39,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:46:39,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-29 05:46:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:39,851 INFO L225 Difference]: With dead ends: 1198 [2023-11-29 05:46:39,851 INFO L226 Difference]: Without dead ends: 1196 [2023-11-29 05:46:39,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 05:46:39,852 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 12 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:39,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5972 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 05:46:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-11-29 05:46:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1192. [2023-11-29 05:46:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 669 states have (on average 1.9387144992526157) internal successors, (1297), 1182 states have internal predecessors, (1297), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:46:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1331 transitions. [2023-11-29 05:46:39,873 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1331 transitions. Word has length 63 [2023-11-29 05:46:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:39,873 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1331 transitions. [2023-11-29 05:46:39,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1331 transitions. [2023-11-29 05:46:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:46:39,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:39,874 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:39,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:40,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:40,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1048289924, now seen corresponding path program 3 times [2023-11-29 05:46:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354700787] [2023-11-29 05:46:40,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:46:40,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:40,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:40,077 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:40,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 05:46:40,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 05:46:40,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:46:40,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:46:40,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:40,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:41,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354700787] [2023-11-29 05:46:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354700787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:41,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:41,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 05:46:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988567226] [2023-11-29 05:46:41,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:41,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:46:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:46:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:46:41,405 INFO L87 Difference]: Start difference. First operand 1192 states and 1331 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:49,485 INFO L93 Difference]: Finished difference Result 1222 states and 1395 transitions. [2023-11-29 05:46:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 05:46:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2023-11-29 05:46:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:49,492 INFO L225 Difference]: With dead ends: 1222 [2023-11-29 05:46:49,492 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 05:46:49,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 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 05:46:49,493 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 24 mSDsluCounter, 13888 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 14883 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:49,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 14883 Invalid, 2978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-11-29 05:46:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 05:46:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1210. [2023-11-29 05:46:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 687 states have (on average 1.9213973799126638) internal successors, (1320), 1200 states have internal predecessors, (1320), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:46:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1354 transitions. [2023-11-29 05:46:49,512 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1354 transitions. Word has length 69 [2023-11-29 05:46:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:49,512 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1354 transitions. [2023-11-29 05:46:49,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:46:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1354 transitions. [2023-11-29 05:46:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:46:49,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:49,513 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:49,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:46:49,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:49,714 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:46:49,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -454916412, now seen corresponding path program 4 times [2023-11-29 05:46:49,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837811242] [2023-11-29 05:46:49,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:46:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:49,716 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:49,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 05:46:50,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:46:50,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:46:50,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:46:50,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:50,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:51,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837811242] [2023-11-29 05:46:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837811242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:51,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 05:46:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273188418] [2023-11-29 05:46:51,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:51,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 05:46:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:51,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 05:46:51,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 05:46:51,813 INFO L87 Difference]: Start difference. First operand 1210 states and 1354 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:47:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:47:08,060 INFO L93 Difference]: Finished difference Result 1267 states and 1464 transitions. [2023-11-29 05:47:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 05:47:08,061 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2023-11-29 05:47:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:47:08,066 INFO L225 Difference]: With dead ends: 1267 [2023-11-29 05:47:08,067 INFO L226 Difference]: Without dead ends: 1265 [2023-11-29 05:47:08,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 05:47:08,071 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 47 mSDsluCounter, 22885 mSDsCounter, 0 mSdLazyCounter, 6068 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 23882 SdHoareTripleChecker+Invalid, 6133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 6068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:47:08,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 23882 Invalid, 6133 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 6068 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2023-11-29 05:47:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2023-11-29 05:47:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1244. [2023-11-29 05:47:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 721 states have (on average 1.8945908460471568) internal successors, (1366), 1234 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:47:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1400 transitions. [2023-11-29 05:47:08,097 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1400 transitions. Word has length 81 [2023-11-29 05:47:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:47:08,097 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1400 transitions. [2023-11-29 05:47:08,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:47:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1400 transitions. [2023-11-29 05:47:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:47:08,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:47:08,099 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:47:08,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:47:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:08,299 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:47:08,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:47:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 9547748, now seen corresponding path program 5 times [2023-11-29 05:47:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:47:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050436323] [2023-11-29 05:47:08,301 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:47:08,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:47:08,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:47:08,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:47:08,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 05:47:09,682 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:47:09,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:47:09,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 05:47:09,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:47:09,738 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 05:47:09,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 05:47:10,165 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 05:47:10,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 05:47:10,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:47:10,465 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 42 treesize of output 24 [2023-11-29 05:47:13,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:47:13,117 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 59 [2023-11-29 05:47:13,192 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 51 treesize of output 27 [2023-11-29 05:47:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:47:13,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:47:13,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:47:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050436323] [2023-11-29 05:47:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050436323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:47:13,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473655346] [2023-11-29 05:47:13,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:47:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:47:13,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:47:13,697 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:47:13,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 05:48:17,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:48:17,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:48:17,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 05:48:17,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:17,511 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:48:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:48:17,875 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 05:48:17,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:48:17,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:48:18,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:48:18,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 05:48:18,617 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 19 [2023-11-29 05:48:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:48:18,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:48:19,085 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 05:48:19,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 05:48:19,093 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2092 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2092) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-11-29 05:48:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [473655346] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:19,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:48:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 05:48:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44443337] [2023-11-29 05:48:19,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:48:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:48:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:48:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:48:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=448, Unknown=2, NotChecked=42, Total=552 [2023-11-29 05:48:19,097 INFO L87 Difference]: Start difference. First operand 1244 states and 1400 transitions. Second operand has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:48:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:48:40,516 INFO L93 Difference]: Finished difference Result 2416 states and 2626 transitions. [2023-11-29 05:48:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:48:40,516 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2023-11-29 05:48:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:48:40,524 INFO L225 Difference]: With dead ends: 2416 [2023-11-29 05:48:40,524 INFO L226 Difference]: Without dead ends: 2412 [2023-11-29 05:48:40,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=1707, Unknown=2, NotChecked=86, Total=2070 [2023-11-29 05:48:40,526 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 5263 mSDsluCounter, 7594 mSDsCounter, 0 mSdLazyCounter, 10885 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5263 SdHoareTripleChecker+Valid, 8097 SdHoareTripleChecker+Invalid, 11128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 10885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:48:40,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5263 Valid, 8097 Invalid, 11128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [243 Valid, 10885 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2023-11-29 05:48:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2023-11-29 05:48:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1290. [2023-11-29 05:48:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 767 states have (on average 1.8409387222946545) internal successors, (1412), 1279 states have internal predecessors, (1412), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:48:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1446 transitions. [2023-11-29 05:48:40,554 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1446 transitions. Word has length 103 [2023-11-29 05:48:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:48:40,554 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1446 transitions. [2023-11-29 05:48:40,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:48:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1446 transitions. [2023-11-29 05:48:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:48:40,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:48:40,556 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:48:40,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 05:48:40,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 05:48:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:48:40,964 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:48:40,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:48:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 9547749, now seen corresponding path program 1 times [2023-11-29 05:48:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:48:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825719942] [2023-11-29 05:48:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:40,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:48:40,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:48:40,966 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:48:40,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 05:48:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:48:41,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 05:48:41,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:48:41,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:48:41,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:48:41,978 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:48:41,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:48:42,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:48:42,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:48:42,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:48:42,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:48:42,888 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:48:42,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:48:42,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:48:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:48:42,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:48:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:48:42,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:48:44,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 05:48:44,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:48:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825719942] [2023-11-29 05:48:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825719942] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:48:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1679976839] [2023-11-29 05:48:44,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:48:44,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:48:44,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:48:44,305 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:48:44,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 05:50:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:26,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 05:50:26,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:26,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:50:26,514 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:50:26,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:50:26,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:50:26,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:50:26,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:50:26,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:50:26,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:50:27,242 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:50:27,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 50 treesize of output 45 [2023-11-29 05:50:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:50:27,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:50:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:50:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:50:27,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:28,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3165) |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 05:50:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1679976839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:28,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:50:28,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 05:50:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419697806] [2023-11-29 05:50:28,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:50:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:50:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 05:50:28,539 INFO L87 Difference]: Start difference. First operand 1290 states and 1446 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:50:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:40,875 INFO L93 Difference]: Finished difference Result 1633 states and 1757 transitions. [2023-11-29 05:50:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:50:40,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2023-11-29 05:50:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:40,880 INFO L225 Difference]: With dead ends: 1633 [2023-11-29 05:50:40,880 INFO L226 Difference]: Without dead ends: 1633 [2023-11-29 05:50:40,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 05:50:40,881 INFO L413 NwaCegarLoop]: 664 mSDtfsCounter, 706 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 5642 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:40,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3071 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5642 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2023-11-29 05:50:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2023-11-29 05:50:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1289. [2023-11-29 05:50:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 767 states have (on average 1.8396349413298565) internal successors, (1411), 1278 states have internal predecessors, (1411), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:50:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1445 transitions. [2023-11-29 05:50:40,904 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1445 transitions. Word has length 103 [2023-11-29 05:50:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1445 transitions. [2023-11-29 05:50:40,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:50:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1445 transitions. [2023-11-29 05:50:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:50:40,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:40,907 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:40,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 05:50:41,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 05:50:41,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:50:41,308 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:50:41,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash 587448315, now seen corresponding path program 1 times [2023-11-29 05:50:41,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:50:41,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271861353] [2023-11-29 05:50:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:50:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:50:41,310 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:50:41,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 05:50:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:42,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:50:42,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:42,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:50:42,198 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:50:42,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:50:42,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:50:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:50:43,111 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:50:43,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:50:43,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:50:43,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:50:43,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:50:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:50:43,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:47,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 05:50:47,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3572 (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3618))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3572)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:50:47,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:50:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271861353] [2023-11-29 05:50:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271861353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:47,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1145907678] [2023-11-29 05:50:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:47,744 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:50:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:50:47,745 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:50:47,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 05:50:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:51,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:50:51,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:51,363 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:50:51,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:50:51,834 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 05:50:51,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:50:51,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:50:52,602 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:50:52,602 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 41 [2023-11-29 05:50:52,769 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:50:52,769 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 41 [2023-11-29 05:50:52,784 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 19 [2023-11-29 05:50:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:50:52,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:57,304 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 05:50:57,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-29 05:50:57,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3572)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 05:50:57,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1145907678] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:57,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:50:57,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 05:50:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626565356] [2023-11-29 05:50:57,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:57,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 05:50:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:50:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 05:50:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=483, Unknown=5, NotChecked=138, Total=702 [2023-11-29 05:50:57,320 INFO L87 Difference]: Start difference. First operand 1289 states and 1445 transitions. Second operand has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:51:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:16,094 INFO L93 Difference]: Finished difference Result 2408 states and 2614 transitions. [2023-11-29 05:51:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:51:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-29 05:51:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:16,101 INFO L225 Difference]: With dead ends: 2408 [2023-11-29 05:51:16,101 INFO L226 Difference]: Without dead ends: 2408 [2023-11-29 05:51:16,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=197, Invalid=1216, Unknown=5, NotChecked=222, Total=1640 [2023-11-29 05:51:16,102 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 3186 mSDsluCounter, 5707 mSDsCounter, 0 mSdLazyCounter, 8145 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3209 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 8145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:16,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3209 Valid, 6220 Invalid, 8269 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 8145 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2023-11-29 05:51:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2023-11-29 05:51:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1288. [2023-11-29 05:51:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 767 states have (on average 1.8383311603650587) internal successors, (1410), 1277 states have internal predecessors, (1410), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:51:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1444 transitions. [2023-11-29 05:51:16,126 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1444 transitions. Word has length 105 [2023-11-29 05:51:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:16,126 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1444 transitions. [2023-11-29 05:51:16,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:51:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1444 transitions. [2023-11-29 05:51:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:51:16,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:16,128 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:16,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-29 05:51:16,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 05:51:16,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:51:16,529 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:51:16,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 587448316, now seen corresponding path program 1 times [2023-11-29 05:51:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:51:16,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131428821] [2023-11-29 05:51:16,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:16,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:51:16,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:51:16,531 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:51:16,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 05:51:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:17,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 05:51:17,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:17,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:51:17,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 05:51:17,545 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:51:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:51:17,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:51:17,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 05:51:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 05:51:17,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:51:18,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:51:18,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:51:18,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:51:18,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:51:18,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:51:18,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:51:18,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 05:51:18,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:51:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:51:18,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:18,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:51:18,876 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4522) |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 05:51:20,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4614) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4613))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4614) .cse2 v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:51:20,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:51:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131428821] [2023-11-29 05:51:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131428821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1384738327] [2023-11-29 05:51:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:20,267 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:51:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:51:20,268 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:51:20,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 05:51:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:23,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 05:51:23,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:23,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:51:24,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:51:24,236 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:51:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:51:24,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:51:24,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:51:24,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:51:24,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:51:25,244 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:51:25,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:51:25,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:51:25,447 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:51:25,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:51:25,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:51:25,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:51:25,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:51:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:51:25,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:25,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5066) |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 05:51:25,578 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5066) |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 05:51:27,066 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5158))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5159) .cse0 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5159) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 05:51:27,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1384738327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:27,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:51:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 05:51:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237600800] [2023-11-29 05:51:27,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:51:27,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:51:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:51:27,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:51:27,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 05:51:27,078 INFO L87 Difference]: Start difference. First operand 1288 states and 1444 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:51:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:38,740 INFO L93 Difference]: Finished difference Result 1641 states and 1766 transitions. [2023-11-29 05:51:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:51:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-29 05:51:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:38,744 INFO L225 Difference]: With dead ends: 1641 [2023-11-29 05:51:38,744 INFO L226 Difference]: Without dead ends: 1641 [2023-11-29 05:51:38,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 05:51:38,745 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1126 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 4463 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 4484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:38,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 2390 Invalid, 4484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4463 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-11-29 05:51:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2023-11-29 05:51:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1287. [2023-11-29 05:51:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 767 states have (on average 1.8370273794002607) internal successors, (1409), 1276 states have internal predecessors, (1409), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:51:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1443 transitions. [2023-11-29 05:51:38,766 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1443 transitions. Word has length 105 [2023-11-29 05:51:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:38,767 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1443 transitions. [2023-11-29 05:51:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:51:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1443 transitions. [2023-11-29 05:51:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:51:38,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:38,768 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:38,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 05:51:38,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 05:51:39,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:51:39,170 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:51:39,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1899106476, now seen corresponding path program 1 times [2023-11-29 05:51:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:51:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018009730] [2023-11-29 05:51:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:39,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:51:39,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:51:39,175 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:51:39,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 05:51:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:40,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 05:51:40,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:40,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:51:40,175 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:51:40,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:51:40,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:51:40,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:51:41,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:51:41,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:51:41,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:51:41,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:51:41,315 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:51:41,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:51:41,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:51:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:51:41,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:49,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:51:49,571 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:51:49,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5627))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5580)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:51:49,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:51:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018009730] [2023-11-29 05:51:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018009730] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [313867659] [2023-11-29 05:51:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:49,988 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:51:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:51:50,004 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:51:50,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 05:52:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:24,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 05:52:24,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:52:24,482 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:52:24,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:52:24,955 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 05:52:24,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:52:25,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:52:25,719 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:52:25,720 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 41 [2023-11-29 05:52:25,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:52:25,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 05:52:26,019 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:52:26,020 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 41 [2023-11-29 05:52:26,036 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 19 [2023-11-29 05:52:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:52:26,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:52:30,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:52:30,192 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:52:30,634 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 05:52:30,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-11-29 05:52:30,646 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6094))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6047)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 05:52:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [313867659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:52:30,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:52:30,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 05:52:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422270690] [2023-11-29 05:52:30,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:52:30,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:52:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:52:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:52:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=617, Unknown=8, NotChecked=330, Total=1056 [2023-11-29 05:52:30,652 INFO L87 Difference]: Start difference. First operand 1287 states and 1443 transitions. Second operand has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:52:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:52:53,748 INFO L93 Difference]: Finished difference Result 2404 states and 2610 transitions. [2023-11-29 05:52:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:52:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-29 05:52:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:52:53,752 INFO L225 Difference]: With dead ends: 2404 [2023-11-29 05:52:53,752 INFO L226 Difference]: Without dead ends: 2404 [2023-11-29 05:52:53,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=241, Invalid=1497, Unknown=8, NotChecked=510, Total=2256 [2023-11-29 05:52:53,753 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2471 mSDsluCounter, 7390 mSDsCounter, 0 mSdLazyCounter, 10569 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 7902 SdHoareTripleChecker+Invalid, 10675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 10569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:52:53,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 7902 Invalid, 10675 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [106 Valid, 10569 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2023-11-29 05:52:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-11-29 05:52:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1286. [2023-11-29 05:52:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 767 states have (on average 1.8357235984354627) internal successors, (1408), 1275 states have internal predecessors, (1408), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:52:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1442 transitions. [2023-11-29 05:52:53,771 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1442 transitions. Word has length 107 [2023-11-29 05:52:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:52:53,771 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1442 transitions. [2023-11-29 05:52:53,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:52:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1442 transitions. [2023-11-29 05:52:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:52:53,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:52:53,772 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:52:53,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 05:52:53,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 05:52:54,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:52:54,173 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:52:54,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1899106477, now seen corresponding path program 1 times [2023-11-29 05:52:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:52:54,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951088999] [2023-11-29 05:52:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:54,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:52:54,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:52:54,175 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:52:54,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 05:52:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:55,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 05:52:55,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:52:55,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:52:55,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:52:55,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:52:55,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:52:55,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 05:52:55,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:52:55,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 05:52:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:52:56,084 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:52:56,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:52:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:52:56,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:52:56,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:52:56,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:52:56,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:52:56,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:52:56,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:52:56,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 05:52:56,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:52:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:52:56,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:52:56,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:52:56,597 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:52:56,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6562))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6561) .cse0 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6561) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 05:52:56,810 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6561) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6562))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6561) .cse3 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:52:59,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6655))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6656) .cse1 v_ArrVal_6561) (select (select (store .cse2 .cse1 v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6563))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6655))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6562))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6656) .cse4 v_ArrVal_6561) .cse5 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 05:52:59,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:52:59,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951088999] [2023-11-29 05:52:59,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951088999] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:52:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [574285256] [2023-11-29 05:52:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:59,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:52:59,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:52:59,362 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:52:59,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 05:53:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:36,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 05:53:36,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:53:36,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:53:37,422 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:53:37,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:53:37,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:53:37,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 05:53:37,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:53:37,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:53:37,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:53:38,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:53:38,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:53:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:53:39,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:53:39,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:53:39,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:53:39,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:53:39,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:53:39,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:53:39,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:53:39,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:53:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:53:39,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:53:39,510 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7126) |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 05:53:39,550 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 05:53:39,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7123) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7124))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7123) .cse2 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:53:39,885 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7123) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7124))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7123) .cse3 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:53:42,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7218))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7124))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7217) .cse0 v_ArrVal_7123) .cse1 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7218))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7217) .cse6 v_ArrVal_7123) (select (select (store .cse7 .cse6 v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7126))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 05:53:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [574285256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:53:42,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:53:42,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 05:53:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354234825] [2023-11-29 05:53:42,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:53:42,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:53:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:53:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:53:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 05:53:42,495 INFO L87 Difference]: Start difference. First operand 1286 states and 1442 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:54:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:54:14,402 INFO L93 Difference]: Finished difference Result 1639 states and 1764 transitions. [2023-11-29 05:54:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:54:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-29 05:54:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:54:14,405 INFO L225 Difference]: With dead ends: 1639 [2023-11-29 05:54:14,405 INFO L226 Difference]: Without dead ends: 1639 [2023-11-29 05:54:14,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 05:54:14,407 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1816 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 8376 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 3731 SdHoareTripleChecker+Invalid, 8408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 8376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:54:14,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1834 Valid, 3731 Invalid, 8408 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 8376 Invalid, 0 Unknown, 0 Unchecked, 31.3s Time] [2023-11-29 05:54:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2023-11-29 05:54:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1285. [2023-11-29 05:54:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 767 states have (on average 1.834419817470665) internal successors, (1407), 1274 states have internal predecessors, (1407), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:54:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1441 transitions. [2023-11-29 05:54:14,422 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1441 transitions. Word has length 107 [2023-11-29 05:54:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:54:14,423 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1441 transitions. [2023-11-29 05:54:14,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:54:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1441 transitions. [2023-11-29 05:54:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:54:14,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:54:14,424 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:14,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 05:54:14,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 05:54:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:14,824 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:54:14,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash -317790408, now seen corresponding path program 1 times [2023-11-29 05:54:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294474092] [2023-11-29 05:54:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:14,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:14,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:14,826 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:14,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 05:54:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:15,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:54:15,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:54:16,154 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:54:16,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:54:16,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:54:16,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:54:17,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:54:17,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:54:18,118 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:54:18,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:54:18,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:54:18,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:54:18,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:54:18,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:54:18,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:54:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:54:18,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:54:18,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7656) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 05:54:18,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:54:18,721 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (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$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7655))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:54:18,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:54:18,771 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7654))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:54:18,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7654))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 05:54:19,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7702))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7654)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:54:19,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294474092] [2023-11-29 05:54:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294474092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:54:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030434366] [2023-11-29 05:54:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:19,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:54:19,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:54:19,413 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:54:19,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 05:55:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:02,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:55:02,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:02,271 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:55:02,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:55:03,157 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 05:55:03,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:55:03,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:55:04,508 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:04,508 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 41 [2023-11-29 05:55:04,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:04,831 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 41 [2023-11-29 05:55:05,052 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:05,052 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 41 [2023-11-29 05:55:05,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:05,283 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 41 [2023-11-29 05:55:05,309 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 19 [2023-11-29 05:55:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:55:05,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:55:08,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:55:08,460 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8138))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:55:08,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:55:08,510 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:55:08,539 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:55:09,175 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 05:55:09,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-11-29 05:55:09,198 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8137)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 05:55:09,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2030434366] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:55:09,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:55:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 05:55:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192379261] [2023-11-29 05:55:09,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:55:09,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 05:55:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:55:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 05:55:09,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=674, Unknown=17, NotChecked=832, Total=1640 [2023-11-29 05:55:09,206 INFO L87 Difference]: Start difference. First operand 1285 states and 1441 transitions. Second operand has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:55:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:55:55,533 INFO L93 Difference]: Finished difference Result 2400 states and 2606 transitions. [2023-11-29 05:55:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 05:55:55,533 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2023-11-29 05:55:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:55:55,538 INFO L225 Difference]: With dead ends: 2400 [2023-11-29 05:55:55,538 INFO L226 Difference]: Without dead ends: 2400 [2023-11-29 05:55:55,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=264, Invalid=1663, Unknown=17, NotChecked=1248, Total=3192 [2023-11-29 05:55:55,539 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 2476 mSDsluCounter, 8784 mSDsCounter, 0 mSdLazyCounter, 12542 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 9295 SdHoareTripleChecker+Invalid, 12653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 12542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:55:55,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 9295 Invalid, 12653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [111 Valid, 12542 Invalid, 0 Unknown, 0 Unchecked, 44.7s Time] [2023-11-29 05:55:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2023-11-29 05:55:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1284. [2023-11-29 05:55:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 767 states have (on average 1.833116036505867) internal successors, (1406), 1273 states have internal predecessors, (1406), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:55:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1440 transitions. [2023-11-29 05:55:55,568 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1440 transitions. Word has length 109 [2023-11-29 05:55:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:55:55,569 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 1440 transitions. [2023-11-29 05:55:55,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:55:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1440 transitions. [2023-11-29 05:55:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:55:55,570 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:55:55,570 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:55:55,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-11-29 05:55:55,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 05:55:55,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:55:55,971 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:55:55,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:55:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -317790407, now seen corresponding path program 1 times [2023-11-29 05:55:55,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:55:55,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797687724] [2023-11-29 05:55:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:55:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:55:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:55:55,973 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:55:55,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 05:55:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:55:57,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 05:55:57,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:55:57,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:55:57,749 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:55:57,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:55:57,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:55:57,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:55:57,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:55:58,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:55:58,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:55:59,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:59,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:55:59,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:55:59,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:55:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:55:59,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:59,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:55:59,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:55:59,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:55:59,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:55:59,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:55:59,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:55:59,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:55:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:55:59,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:00,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:56:00,266 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8672) |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 05:56:00,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8669))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8670) .cse0 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8670) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 05:56:00,382 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8670) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8669))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8670) .cse3 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:56:00,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8668))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8669))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8667) .cse0 v_ArrVal_8670) .cse1 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8668))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8667) .cse6 v_ArrVal_8670) (select (select (store .cse7 .cse6 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8672))) |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 05:56:00,533 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8668))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8667) .cse2 v_ArrVal_8670) (select (select (store .cse3 .cse2 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8672))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8668))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8669))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8667) .cse5 v_ArrVal_8670) .cse6 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 05:56:02,261 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8764))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8668))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8669))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8763) .cse0 v_ArrVal_8667) .cse1 v_ArrVal_8670) .cse2 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8764))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8668))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8763) .cse8 v_ArrVal_8667) .cse9 v_ArrVal_8670) (select (select (store .cse10 .cse9 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8672))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 05:56:02,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:56:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797687724] [2023-11-29 05:56:02,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797687724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:56:02,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1669106554] [2023-11-29 05:56:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:56:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:56:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:56:02,291 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:56:02,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 05:56:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:56:50,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 05:56:50,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:56:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:56:50,728 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:56:50,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 05:56:50,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:56:50,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:56:50,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:56:50,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:56:50,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:56:51,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:56:51,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:56:52,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:56:52,135 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:56:52,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:56:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:56:52,228 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:56:52,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:56:52,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 24 treesize of output 11 [2023-11-29 05:56:52,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:56:52,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:56:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:56:52,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 05:56:52,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:56:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:56:52,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:56:52,440 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 05:56:52,483 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:56:52,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9249))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9248) .cse0 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9248) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9250) |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 05:56:52,617 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9248) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9249))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9248) .cse3 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:57:15,783 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9342))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9246))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9249))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9343) .cse0 v_ArrVal_9247) .cse1 v_ArrVal_9248) .cse2 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9342))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9246))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9343) .cse8 v_ArrVal_9247) .cse9 v_ArrVal_9248) (select (select (store .cse10 .cse9 v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9250))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 05:57:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1669106554] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:57:15,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 05:57:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273618795] [2023-11-29 05:57:15,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:57:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:57:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=189, Unknown=29, NotChecked=468, Total=756 [2023-11-29 05:57:15,820 INFO L87 Difference]: Start difference. First operand 1284 states and 1440 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:58:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:30,145 INFO L93 Difference]: Finished difference Result 1627 states and 1751 transitions. [2023-11-29 05:58:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:58:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2023-11-29 05:58:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:30,150 INFO L225 Difference]: With dead ends: 1627 [2023-11-29 05:58:30,150 INFO L226 Difference]: Without dead ends: 1627 [2023-11-29 05:58:30,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=122, Invalid=402, Unknown=30, NotChecked=636, Total=1190 [2023-11-29 05:58:30,151 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 697 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:30,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2401 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 62.5s Time] [2023-11-29 05:58:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2023-11-29 05:58:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1283. [2023-11-29 05:58:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 767 states have (on average 1.8318122555410692) internal successors, (1405), 1272 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 05:58:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1439 transitions. [2023-11-29 05:58:30,174 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1439 transitions. Word has length 109 [2023-11-29 05:58:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:30,175 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1439 transitions. [2023-11-29 05:58:30,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:58:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1439 transitions. [2023-11-29 05:58:30,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 05:58:30,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:30,176 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:30,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:58:30,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 05:58:30,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:58:30,577 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 05:58:30,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -451859169, now seen corresponding path program 1 times [2023-11-29 05:58:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:58:30,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758705335] [2023-11-29 05:58:30,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:30,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:30,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:58:30,579 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:58:30,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:58:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:31,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 05:58:31,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:32,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:58:33,574 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:58:33,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:58:33,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 05:58:34,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:58:41,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:58:41,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:58:41,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:58:41,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:58:42,677 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:58:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:58:43,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:58:43,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:58:44,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:58:44,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:58:44,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:58:44,525 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 05:58:44,526 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 05:58:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:58:44,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:45,721 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 05:58:45,793 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:58:45,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9798))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 05:58:45,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:58:46,024 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9797))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 05:58:46,106 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:58:46,193 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9796))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:58:46,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9796))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:58:48,132 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9846))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9796)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:58:48,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:58:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758705335] [2023-11-29 05:58:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758705335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:58:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1737644025] [2023-11-29 05:58:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:48,153 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:58:48,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:58:48,155 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:58:48,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b1544ce-de6f-4e65-ba19-3dc681234b89/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 05:59:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:01,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 05:59:01,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:01,937 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:59:01,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:59:06,353 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 05:59:06,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:59:06,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:59:12,838 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:59:12,838 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 41 [2023-11-29 05:59:14,462 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:59:14,462 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 41 [2023-11-29 05:59:15,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:59:15,456 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 41 [2023-11-29 05:59:16,479 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:59:16,479 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 41 [2023-11-29 05:59:17,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:59:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 05:59:17,645 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 19 [2023-11-29 05:59:17,941 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 05:59:17,941 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 20 [2023-11-29 05:59:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 05:59:18,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:23,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10301) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 05:59:23,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 05:59:23,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:23,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:23,898 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10299))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:24,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:24,124 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10298))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:24,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10302 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10302) (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10298))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 05:59:26,588 INFO L349 Elim1Store]: treesize reduction 207, result has 49.4 percent of original size [2023-11-29 05:59:26,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 603 treesize of output 609 [2023-11-29 05:59:26,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10348 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10348))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10298)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 05:59:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1737644025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:59:26,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:59:26,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 26 [2023-11-29 05:59:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306412503] [2023-11-29 05:59:26,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:26,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 05:59:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:59:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:59:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=777, Unknown=19, NotChecked=1314, Total=2256 [2023-11-29 05:59:26,722 INFO L87 Difference]: Start difference. First operand 1283 states and 1439 transitions. Second operand has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 26 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)