./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:02:26,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:02:26,219 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:02:26,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:02:26,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:02:26,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:02:26,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:02:26,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:02:26,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:02:26,251 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:02:26,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:02:26,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:02:26,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:02:26,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:02:26,254 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:02:26,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:02:26,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:02:26,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:02:26,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:02:26,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:02:26,257 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:02:26,261 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:02:26,261 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:02:26,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:02:26,262 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:02:26,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:02:26,262 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:02:26,263 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:02:26,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:02:26,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:02:26,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:02:26,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:02:26,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:02:26,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:02:26,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:02:26,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:02:26,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:02:26,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:02:26,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:02:26,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:02:26,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:02:26,266 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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2023-11-29 00:02:26,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:02:26,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:02:26,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:02:26,545 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:02:26,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:02:26,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-11-29 00:02:29,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:02:29,517 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:02:29,518 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-11-29 00:02:29,537 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/68ae19d78/8ef5700f971a44aa8913d2280a3d3b04/FLAGbe8470a9d [2023-11-29 00:02:29,552 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/68ae19d78/8ef5700f971a44aa8913d2280a3d3b04 [2023-11-29 00:02:29,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:02:29,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:02:29,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:29,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:02:29,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:02:29,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:29" (1/1) ... [2023-11-29 00:02:29,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f3733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:29, skipping insertion in model container [2023-11-29 00:02:29,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:29" (1/1) ... [2023-11-29 00:02:29,628 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:02:30,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:30,300 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 00:02:30,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4019a731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:30, skipping insertion in model container [2023-11-29 00:02:30,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:30,301 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:02:30,303 INFO L158 Benchmark]: Toolchain (without parser) took 746.60ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 90.4MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:02:30,304 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:02:30,305 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.10ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 90.4MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:02:30,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.10ms. Allocated memory is still 151.0MB. Free memory was 112.0MB in the beginning and 90.4MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:02:32,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:02:32,100 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:02:32,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:02:32,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:02:32,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:02:32,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:02:32,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:02:32,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:02:32,133 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:02:32,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:02:32,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:02:32,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:02:32,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:02:32,136 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:02:32,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:02:32,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:02:32,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:02:32,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:02:32,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:02:32,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:02:32,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:02:32,140 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:02:32,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:02:32,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:02:32,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:02:32,141 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:02:32,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:02:32,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:02:32,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:02:32,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:02:32,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:02:32,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:02:32,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:02:32,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:02:32,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:02:32,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:02:32,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:02:32,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:02:32,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:02:32,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:02:32,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:02:32,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:02:32,146 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:02:32,146 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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2023-11-29 00:02:32,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:02:32,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:02:32,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:02:32,464 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:02:32,465 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:02:32,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-11-29 00:02:35,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:02:35,511 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:02:35,511 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-11-29 00:02:35,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/07126ff8c/547cb0c8efe8458db438e3a7e34084fa/FLAGc5a430925 [2023-11-29 00:02:35,544 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/data/07126ff8c/547cb0c8efe8458db438e3a7e34084fa [2023-11-29 00:02:35,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:02:35,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:02:35,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:35,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:02:35,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:02:35,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:35" (1/1) ... [2023-11-29 00:02:35,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd3f333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:35, skipping insertion in model container [2023-11-29 00:02:35,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:02:35" (1/1) ... [2023-11-29 00:02:35,621 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:02:36,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:36,262 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:02:36,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:02:36,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:36,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:02:36,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:02:36,504 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:02:36,512 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:02:36,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36 WrapperNode [2023-11-29 00:02:36,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:02:36,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:02:36,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:02:36,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:02:36,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,625 INFO L138 Inliner]: procedures = 285, calls = 298, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1048 [2023-11-29 00:02:36,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:02:36,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:02:36,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:02:36,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:02:36,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,759 INFO L175 MemorySlicer]: Split 264 memory accesses to 5 slices as follows [2, 3, 34, 5, 220]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 56 writes are split as follows [0, 2, 4, 1, 49]. [2023-11-29 00:02:36,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:02:36,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:02:36,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:02:36,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:02:36,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (1/1) ... [2023-11-29 00:02:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:02:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:02:36,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:02:36,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:02:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 00:02:36,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 00:02:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:02:36,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:02:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:02:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:02:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 00:02:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:02:36,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:02:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:02:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:02:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 00:02:36,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:02:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:02:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:02:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:02:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:02:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:02:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 00:02:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:02:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:02:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:02:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:02:36,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 00:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-11-29 00:02:36,914 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-11-29 00:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 00:02:36,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 00:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:02:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:02:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-11-29 00:02:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-11-29 00:02:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:02:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:02:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:02:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:02:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 00:02:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-11-29 00:02:36,916 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-11-29 00:02:36,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:02:36,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:02:37,158 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:02:37,161 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:02:41,500 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:02:41,682 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:02:41,683 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 00:02:41,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:41 BoogieIcfgContainer [2023-11-29 00:02:41,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:02:41,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:02:41,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:02:41,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:02:41,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:02:35" (1/3) ... [2023-11-29 00:02:41,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d01d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:02:41, skipping insertion in model container [2023-11-29 00:02:41,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:02:36" (2/3) ... [2023-11-29 00:02:41,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d01d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:02:41, skipping insertion in model container [2023-11-29 00:02:41,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:02:41" (3/3) ... [2023-11-29 00:02:41,693 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2023-11-29 00:02:41,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:02:41,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 528 error locations. [2023-11-29 00:02:41,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:02:41,778 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;@45911a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:02:41,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 528 error locations. [2023-11-29 00:02:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:02:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:02:41,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:41,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:02:41,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:41,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:41,797 INFO L85 PathProgramCache]: Analyzing trace with hash 55333, now seen corresponding path program 1 times [2023-11-29 00:02:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664603731] [2023-11-29 00:02:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:41,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:41,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:02:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:41,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:02:41,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:42,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:02:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:42,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:42,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664603731] [2023-11-29 00:02:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664603731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:42,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:02:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213685516] [2023-11-29 00:02:42,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:42,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:02:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:02:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:42,118 INFO L87 Difference]: Start difference. First operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:44,270 INFO L93 Difference]: Finished difference Result 1054 states and 1123 transitions. [2023-11-29 00:02:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:02:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:02:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:02:44,293 INFO L225 Difference]: With dead ends: 1054 [2023-11-29 00:02:44,293 INFO L226 Difference]: Without dead ends: 1053 [2023-11-29 00:02:44,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:44,297 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 650 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:02:44,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 862 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:02:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-11-29 00:02:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2023-11-29 00:02:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 459 states have (on average 2.3398692810457518) internal successors, (1074), 977 states have internal predecessors, (1074), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:02:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1104 transitions. [2023-11-29 00:02:44,379 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1104 transitions. Word has length 2 [2023-11-29 00:02:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:02:44,379 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1104 transitions. [2023-11-29 00:02:44,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1104 transitions. [2023-11-29 00:02:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:02:44,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:44,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:02:44,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:44,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:44,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:44,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash 55334, now seen corresponding path program 1 times [2023-11-29 00:02:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530565257] [2023-11-29 00:02:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:44,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:44,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:44,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:02:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:44,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:02:44,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:02:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:44,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:44,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530565257] [2023-11-29 00:02:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530565257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:44,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:02:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026836502] [2023-11-29 00:02:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:02:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:44,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:02:44,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:44,742 INFO L87 Difference]: Start difference. First operand 995 states and 1104 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:47,779 INFO L93 Difference]: Finished difference Result 1353 states and 1498 transitions. [2023-11-29 00:02:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:02:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:02:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:02:47,787 INFO L225 Difference]: With dead ends: 1353 [2023-11-29 00:02:47,787 INFO L226 Difference]: Without dead ends: 1353 [2023-11-29 00:02:47,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:47,788 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 382 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:02:47,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 00:02:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-11-29 00:02:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1165. [2023-11-29 00:02:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.3121019108280256) internal successors, (1452), 1145 states have internal predecessors, (1452), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:02:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1486 transitions. [2023-11-29 00:02:47,818 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1486 transitions. Word has length 2 [2023-11-29 00:02:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:02:47,819 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1486 transitions. [2023-11-29 00:02:47,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1486 transitions. [2023-11-29 00:02:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:02:47,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:47,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:02:47,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:02:48,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:48,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:48,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash -435639276, now seen corresponding path program 1 times [2023-11-29 00:02:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:48,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465444173] [2023-11-29 00:02:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:48,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:48,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:02:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:48,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:02:48,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:48,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:02:48,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:02:48,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:48,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:02:48,299 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:02:48,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:02:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:48,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:48,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465444173] [2023-11-29 00:02:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465444173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:02:48,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727410982] [2023-11-29 00:02:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:02:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:02:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:02:48,325 INFO L87 Difference]: Start difference. First operand 1165 states and 1486 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:52,193 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2023-11-29 00:02:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:02:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 00:02:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:02:52,202 INFO L225 Difference]: With dead ends: 1792 [2023-11-29 00:02:52,202 INFO L226 Difference]: Without dead ends: 1792 [2023-11-29 00:02:52,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:02:52,203 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 1292 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:02:52,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1013 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 00:02:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-11-29 00:02:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1281. [2023-11-29 00:02:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 744 states have (on average 2.293010752688172) internal successors, (1706), 1261 states have internal predecessors, (1706), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:02:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1740 transitions. [2023-11-29 00:02:52,235 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1740 transitions. Word has length 6 [2023-11-29 00:02:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:02:52,236 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1740 transitions. [2023-11-29 00:02:52,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1740 transitions. [2023-11-29 00:02:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:02:52,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:52,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:52,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:02:52,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:52,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:52,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash -619915645, now seen corresponding path program 1 times [2023-11-29 00:02:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391921052] [2023-11-29 00:02:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:52,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:52,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:02:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:52,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:02:52,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:52,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:02:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:52,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:52,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391921052] [2023-11-29 00:02:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391921052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:02:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326900245] [2023-11-29 00:02:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:52,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:02:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:02:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:52,566 INFO L87 Difference]: Start difference. First operand 1281 states and 1740 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:54,578 INFO L93 Difference]: Finished difference Result 1760 states and 2444 transitions. [2023-11-29 00:02:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:02:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:02:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:02:54,587 INFO L225 Difference]: With dead ends: 1760 [2023-11-29 00:02:54,587 INFO L226 Difference]: Without dead ends: 1760 [2023-11-29 00:02:54,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:54,589 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 869 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:02:54,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1073 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:02:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2023-11-29 00:02:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1236. [2023-11-29 00:02:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 744 states have (on average 2.213709677419355) internal successors, (1647), 1216 states have internal predecessors, (1647), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:02:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1681 transitions. [2023-11-29 00:02:54,616 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1681 transitions. Word has length 7 [2023-11-29 00:02:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:02:54,617 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1681 transitions. [2023-11-29 00:02:54,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1681 transitions. [2023-11-29 00:02:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:02:54,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:54,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:54,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:02:54,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:54,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:54,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash -619915644, now seen corresponding path program 1 times [2023-11-29 00:02:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751003623] [2023-11-29 00:02:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:54,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:54,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:54,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:02:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:54,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:02:54,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:54,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:02:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:54,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:54,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751003623] [2023-11-29 00:02:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751003623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:02:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508486779] [2023-11-29 00:02:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:54,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:02:54,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:02:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:54,976 INFO L87 Difference]: Start difference. First operand 1236 states and 1681 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:02:58,046 INFO L93 Difference]: Finished difference Result 1793 states and 2433 transitions. [2023-11-29 00:02:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:02:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:02:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:02:58,055 INFO L225 Difference]: With dead ends: 1793 [2023-11-29 00:02:58,055 INFO L226 Difference]: Without dead ends: 1793 [2023-11-29 00:02:58,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:02:58,056 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 620 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:02:58,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 00:02:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-11-29 00:02:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1226. [2023-11-29 00:02:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 744 states have (on average 2.181451612903226) internal successors, (1623), 1206 states have internal predecessors, (1623), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:02:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1657 transitions. [2023-11-29 00:02:58,084 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1657 transitions. Word has length 7 [2023-11-29 00:02:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:02:58,085 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1657 transitions. [2023-11-29 00:02:58,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:02:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1657 transitions. [2023-11-29 00:02:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:02:58,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:02:58,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:02:58,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:02:58,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:58,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:02:58,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -3807760, now seen corresponding path program 1 times [2023-11-29 00:02:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195353198] [2023-11-29 00:02:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:02:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:58,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:58,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:58,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:02:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:02:58,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:02:58,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:58,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:02:58,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195353198] [2023-11-29 00:02:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195353198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:02:58,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:02:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:02:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285016171] [2023-11-29 00:02:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:02:58,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:02:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:02:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:02:58,485 INFO L87 Difference]: Start difference. First operand 1226 states and 1657 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:00,224 INFO L93 Difference]: Finished difference Result 1658 states and 2181 transitions. [2023-11-29 00:03:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:03:00,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 00:03:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:00,233 INFO L225 Difference]: With dead ends: 1658 [2023-11-29 00:03:00,233 INFO L226 Difference]: Without dead ends: 1658 [2023-11-29 00:03:00,233 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 00:03:00,233 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 494 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:00,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2481 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 00:03:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2023-11-29 00:03:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1436. [2023-11-29 00:03:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 954 states have (on average 2.190775681341719) internal successors, (2090), 1416 states have internal predecessors, (2090), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:03:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2124 transitions. [2023-11-29 00:03:00,271 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2124 transitions. Word has length 12 [2023-11-29 00:03:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:00,271 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 2124 transitions. [2023-11-29 00:03:00,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2124 transitions. [2023-11-29 00:03:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:03:00,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:00,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:00,274 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:03:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:00,473 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:00,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -592731144, now seen corresponding path program 1 times [2023-11-29 00:03:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821542378] [2023-11-29 00:03:00,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:00,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:00,475 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:00,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:03:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:00,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:03:00,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:00,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:00,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:00,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821542378] [2023-11-29 00:03:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821542378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445027131] [2023-11-29 00:03:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:00,637 INFO L87 Difference]: Start difference. First operand 1436 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:01,424 INFO L93 Difference]: Finished difference Result 1352 states and 1964 transitions. [2023-11-29 00:03:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 00:03:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:01,433 INFO L225 Difference]: With dead ends: 1352 [2023-11-29 00:03:01,433 INFO L226 Difference]: Without dead ends: 1352 [2023-11-29 00:03:01,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:01,433 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 70 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:01,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1583 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:03:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-29 00:03:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-11-29 00:03:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 894 states have (on average 2.1588366890380315) internal successors, (1930), 1332 states have internal predecessors, (1930), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 00:03:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1964 transitions. [2023-11-29 00:03:01,464 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1964 transitions. Word has length 12 [2023-11-29 00:03:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:01,464 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1964 transitions. [2023-11-29 00:03:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1964 transitions. [2023-11-29 00:03:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:03:01,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:01,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:01,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:03:01,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:01,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:01,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1869888457, now seen corresponding path program 1 times [2023-11-29 00:03:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:01,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829384851] [2023-11-29 00:03:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:01,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:01,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:01,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:03:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:01,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:03:01,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:01,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:03:01,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:03:01,828 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:03:01,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 00:03:01,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:03:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 00:03:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:01,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:01,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829384851] [2023-11-29 00:03:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829384851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:03:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947897451] [2023-11-29 00:03:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:01,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:01,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:01,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:01,906 INFO L87 Difference]: Start difference. First operand 1352 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:03,609 INFO L93 Difference]: Finished difference Result 1868 states and 2266 transitions. [2023-11-29 00:03:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:03:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:03,616 INFO L225 Difference]: With dead ends: 1868 [2023-11-29 00:03:03,617 INFO L226 Difference]: Without dead ends: 1868 [2023-11-29 00:03:03,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:03,617 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 821 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:03,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2546 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 00:03:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2023-11-29 00:03:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1085. [2023-11-29 00:03:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 629 states have (on average 2.1446740858505566) internal successors, (1349), 1067 states have internal predecessors, (1349), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1379 transitions. [2023-11-29 00:03:03,651 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1379 transitions. Word has length 15 [2023-11-29 00:03:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:03,651 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1379 transitions. [2023-11-29 00:03:03,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1379 transitions. [2023-11-29 00:03:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:03:03,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:03,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:03,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:03,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:03,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:03,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:03,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1792162074, now seen corresponding path program 1 times [2023-11-29 00:03:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130549731] [2023-11-29 00:03:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:03,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:03,854 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:03,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:03:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:04,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:03:04,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:04,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:04,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:04,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130549731] [2023-11-29 00:03:04,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130549731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:04,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:04,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141208301] [2023-11-29 00:03:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:04,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:04,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:04,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:04,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:04,012 INFO L87 Difference]: Start difference. First operand 1085 states and 1379 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:05,044 INFO L93 Difference]: Finished difference Result 1031 states and 1299 transitions. [2023-11-29 00:03:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:03:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:05,051 INFO L225 Difference]: With dead ends: 1031 [2023-11-29 00:03:05,051 INFO L226 Difference]: Without dead ends: 1031 [2023-11-29 00:03:05,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:05,052 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 70 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:05,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:03:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-11-29 00:03:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2023-11-29 00:03:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 599 states have (on average 2.1185308848080133) internal successors, (1269), 1013 states have internal predecessors, (1269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1299 transitions. [2023-11-29 00:03:05,069 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1299 transitions. Word has length 15 [2023-11-29 00:03:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:05,069 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1299 transitions. [2023-11-29 00:03:05,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1299 transitions. [2023-11-29 00:03:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:03:05,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:05,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:05,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:05,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:05,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:05,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash -14134636, now seen corresponding path program 1 times [2023-11-29 00:03:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639436507] [2023-11-29 00:03:05,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:05,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:05,273 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:05,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:03:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:05,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:03:05,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:05,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:05,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639436507] [2023-11-29 00:03:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639436507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:03:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579531338] [2023-11-29 00:03:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:05,506 INFO L87 Difference]: Start difference. First operand 1031 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:06,415 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2023-11-29 00:03:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:03:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:06,421 INFO L225 Difference]: With dead ends: 1017 [2023-11-29 00:03:06,422 INFO L226 Difference]: Without dead ends: 1017 [2023-11-29 00:03:06,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:06,422 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 58 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:06,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2220 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:03:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-11-29 00:03:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-11-29 00:03:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 597 states have (on average 2.0519262981574538) internal successors, (1225), 997 states have internal predecessors, (1225), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1255 transitions. [2023-11-29 00:03:06,437 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1255 transitions. Word has length 17 [2023-11-29 00:03:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:06,438 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1255 transitions. [2023-11-29 00:03:06,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:06,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1255 transitions. [2023-11-29 00:03:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:03:06,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:06,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:06,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:06,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:06,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:06,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash 734266083, now seen corresponding path program 1 times [2023-11-29 00:03:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166091522] [2023-11-29 00:03:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:06,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:06,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:06,642 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:06,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:03:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:06,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:03:06,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:06,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:03:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:07,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:07,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166091522] [2023-11-29 00:03:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166091522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:07,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927487421] [2023-11-29 00:03:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:07,017 INFO L87 Difference]: Start difference. First operand 1015 states and 1255 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:11,081 INFO L93 Difference]: Finished difference Result 1482 states and 1848 transitions. [2023-11-29 00:03:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:03:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:11,089 INFO L225 Difference]: With dead ends: 1482 [2023-11-29 00:03:11,089 INFO L226 Difference]: Without dead ends: 1482 [2023-11-29 00:03:11,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:11,090 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:11,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1885 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:03:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-11-29 00:03:11,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1011. [2023-11-29 00:03:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 597 states have (on average 2.0385259631490786) internal successors, (1217), 993 states have internal predecessors, (1217), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1247 transitions. [2023-11-29 00:03:11,114 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1247 transitions. Word has length 31 [2023-11-29 00:03:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:11,114 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1247 transitions. [2023-11-29 00:03:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1247 transitions. [2023-11-29 00:03:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:03:11,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:11,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:11,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:03:11,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:11,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:11,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 734266082, now seen corresponding path program 1 times [2023-11-29 00:03:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:11,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589199162] [2023-11-29 00:03:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:11,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:11,318 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:11,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:03:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:11,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:03:11,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:11,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:03:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:11,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:11,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:11,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589199162] [2023-11-29 00:03:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589199162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:03:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94570125] [2023-11-29 00:03:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:11,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:11,611 INFO L87 Difference]: Start difference. First operand 1011 states and 1247 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:14,193 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2023-11-29 00:03:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:03:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:14,202 INFO L225 Difference]: With dead ends: 1391 [2023-11-29 00:03:14,202 INFO L226 Difference]: Without dead ends: 1391 [2023-11-29 00:03:14,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:14,203 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 754 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1032 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 00:03:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-29 00:03:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1007. [2023-11-29 00:03:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 597 states have (on average 2.0251256281407035) internal successors, (1209), 989 states have internal predecessors, (1209), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1239 transitions. [2023-11-29 00:03:14,219 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1239 transitions. Word has length 31 [2023-11-29 00:03:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:14,219 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1239 transitions. [2023-11-29 00:03:14,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1239 transitions. [2023-11-29 00:03:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 00:03:14,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:14,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:14,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:14,422 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:14,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2030840777, now seen corresponding path program 1 times [2023-11-29 00:03:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751593189] [2023-11-29 00:03:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:14,424 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:14,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:03:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:14,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:03:14,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:14,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:14,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751593189] [2023-11-29 00:03:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751593189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:14,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:03:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803804534] [2023-11-29 00:03:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:14,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:14,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:14,699 INFO L87 Difference]: Start difference. First operand 1007 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:15,558 INFO L93 Difference]: Finished difference Result 995 states and 1219 transitions. [2023-11-29 00:03:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 00:03:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:15,563 INFO L225 Difference]: With dead ends: 995 [2023-11-29 00:03:15,563 INFO L226 Difference]: Without dead ends: 995 [2023-11-29 00:03:15,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:15,564 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 23 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:15,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2206 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:03:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-11-29 00:03:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-11-29 00:03:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 585 states have (on average 2.0324786324786324) internal successors, (1189), 977 states have internal predecessors, (1189), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:03:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1219 transitions. [2023-11-29 00:03:15,576 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1219 transitions. Word has length 51 [2023-11-29 00:03:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:15,576 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1219 transitions. [2023-11-29 00:03:15,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1219 transitions. [2023-11-29 00:03:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:03:15,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:15,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:15,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:15,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:15,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:15,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890552, now seen corresponding path program 1 times [2023-11-29 00:03:15,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:15,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820508610] [2023-11-29 00:03:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:15,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:15,780 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:15,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:03:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:16,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:03:16,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:16,182 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 00:03:16,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:03:16,219 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:03:16,220 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 00:03:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:16,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:16,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820508610] [2023-11-29 00:03:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820508610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:16,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:03:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270728545] [2023-11-29 00:03:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:16,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:03:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:03:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:16,519 INFO L87 Difference]: Start difference. First operand 995 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:18,793 INFO L93 Difference]: Finished difference Result 1813 states and 2222 transitions. [2023-11-29 00:03:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:03:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 00:03:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:18,802 INFO L225 Difference]: With dead ends: 1813 [2023-11-29 00:03:18,802 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 00:03:18,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:03:18,803 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 713 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:18,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 918 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 00:03:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 00:03:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1343. [2023-11-29 00:03:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 918 states have (on average 2.02723311546841) internal successors, (1861), 1313 states have internal predecessors, (1861), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:03:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1915 transitions. [2023-11-29 00:03:18,827 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1915 transitions. Word has length 55 [2023-11-29 00:03:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:18,827 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1915 transitions. [2023-11-29 00:03:18,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1915 transitions. [2023-11-29 00:03:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:03:18,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:18,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:18,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 00:03:19,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:19,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:19,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890553, now seen corresponding path program 1 times [2023-11-29 00:03:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507801496] [2023-11-29 00:03:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:19,031 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:19,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:03:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:19,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:03:19,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:19,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:19,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:03:19,472 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 00:03:19,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 00:03:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:20,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:20,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507801496] [2023-11-29 00:03:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507801496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:03:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963040093] [2023-11-29 00:03:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:20,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:03:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:03:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:20,089 INFO L87 Difference]: Start difference. First operand 1343 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:22,906 INFO L93 Difference]: Finished difference Result 1348 states and 1921 transitions. [2023-11-29 00:03:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:03:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 00:03:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:22,913 INFO L225 Difference]: With dead ends: 1348 [2023-11-29 00:03:22,913 INFO L226 Difference]: Without dead ends: 1348 [2023-11-29 00:03:22,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:03:22,914 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:22,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:03:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-11-29 00:03:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2023-11-29 00:03:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 922 states have (on average 2.022776572668113) internal successors, (1865), 1317 states have internal predecessors, (1865), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 00:03:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1921 transitions. [2023-11-29 00:03:22,935 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1921 transitions. Word has length 55 [2023-11-29 00:03:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:22,935 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1921 transitions. [2023-11-29 00:03:22,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1921 transitions. [2023-11-29 00:03:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 00:03:22,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:22,936 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 00:03:22,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:03:23,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:23,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:23,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 298511460, now seen corresponding path program 1 times [2023-11-29 00:03:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642026379] [2023-11-29 00:03:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:23,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:23,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:23,139 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:23,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:03:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:23,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:03:23,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:23,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:23,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642026379] [2023-11-29 00:03:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642026379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:03:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036216193] [2023-11-29 00:03:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:23,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:03:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:03:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:03:23,525 INFO L87 Difference]: Start difference. First operand 1348 states and 1921 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:03:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:25,153 INFO L93 Difference]: Finished difference Result 1352 states and 1929 transitions. [2023-11-29 00:03:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:03:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-29 00:03:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:25,163 INFO L225 Difference]: With dead ends: 1352 [2023-11-29 00:03:25,163 INFO L226 Difference]: Without dead ends: 1352 [2023-11-29 00:03:25,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:03:25,164 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 19 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:25,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3610 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 00:03:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-29 00:03:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2023-11-29 00:03:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 923 states have (on average 2.021668472372698) internal successors, (1866), 1318 states have internal predecessors, (1866), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2023-11-29 00:03:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1925 transitions. [2023-11-29 00:03:25,186 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1925 transitions. Word has length 59 [2023-11-29 00:03:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:25,186 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1925 transitions. [2023-11-29 00:03:25,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:03:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1925 transitions. [2023-11-29 00:03:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 00:03:25,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:25,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:25,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:25,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:25,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:25,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1320167083, now seen corresponding path program 1 times [2023-11-29 00:03:25,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:25,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352727650] [2023-11-29 00:03:25,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:25,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:25,389 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:25,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 00:03:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:25,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:03:25,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:25,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:25,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352727650] [2023-11-29 00:03:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352727650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:03:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333469405] [2023-11-29 00:03:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:03:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:03:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:03:25,700 INFO L87 Difference]: Start difference. First operand 1350 states and 1925 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:27,096 INFO L93 Difference]: Finished difference Result 1374 states and 1949 transitions. [2023-11-29 00:03:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:03:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-29 00:03:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:27,112 INFO L225 Difference]: With dead ends: 1374 [2023-11-29 00:03:27,113 INFO L226 Difference]: Without dead ends: 1374 [2023-11-29 00:03:27,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:03:27,113 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 16 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:27,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3763 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 00:03:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-11-29 00:03:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1370. [2023-11-29 00:03:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 937 states have (on average 2.0117395944503733) internal successors, (1885), 1334 states have internal predecessors, (1885), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 00:03:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1946 transitions. [2023-11-29 00:03:27,137 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1946 transitions. Word has length 62 [2023-11-29 00:03:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:27,137 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1946 transitions. [2023-11-29 00:03:27,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:03:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1946 transitions. [2023-11-29 00:03:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:03:27,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:27,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:27,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 00:03:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:27,339 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:27,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192545, now seen corresponding path program 1 times [2023-11-29 00:03:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935509984] [2023-11-29 00:03:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:27,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:27,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:27,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 00:03:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:27,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:03:27,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:03:27,879 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-11-29 00:03:27,895 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:03:27,895 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 00:03:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:27,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:27,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935509984] [2023-11-29 00:03:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935509984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:03:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111420152] [2023-11-29 00:03:27,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:27,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:03:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:27,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:03:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 00:03:27,914 INFO L87 Difference]: Start difference. First operand 1370 states and 1946 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:30,139 INFO L93 Difference]: Finished difference Result 1753 states and 2454 transitions. [2023-11-29 00:03:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:03:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 00:03:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:30,146 INFO L225 Difference]: With dead ends: 1753 [2023-11-29 00:03:30,146 INFO L226 Difference]: Without dead ends: 1753 [2023-11-29 00:03:30,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 00:03:30,147 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 723 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:30,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 977 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 1207 Unchecked, 2.2s Time] [2023-11-29 00:03:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2023-11-29 00:03:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1369. [2023-11-29 00:03:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 937 states have (on average 2.0096051227321237) internal successors, (1883), 1333 states have internal predecessors, (1883), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 00:03:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1944 transitions. [2023-11-29 00:03:30,167 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1944 transitions. Word has length 64 [2023-11-29 00:03:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:30,168 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1944 transitions. [2023-11-29 00:03:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1944 transitions. [2023-11-29 00:03:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:03:30,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:30,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:30,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 00:03:30,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:30,369 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:30,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192544, now seen corresponding path program 1 times [2023-11-29 00:03:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:30,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337372123] [2023-11-29 00:03:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:30,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:30,370 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:30,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 00:03:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:30,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:03:30,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:30,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:03:30,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 00:03:31,186 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-11-29 00:03:31,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:31,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:03:31,239 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:03:31,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:03:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:31,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:31,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337372123] [2023-11-29 00:03:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337372123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:31,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:31,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:03:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90697301] [2023-11-29 00:03:31,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:31,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:03:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:03:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 00:03:31,252 INFO L87 Difference]: Start difference. First operand 1369 states and 1944 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:36,330 INFO L93 Difference]: Finished difference Result 2312 states and 3241 transitions. [2023-11-29 00:03:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:03:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 00:03:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:36,337 INFO L225 Difference]: With dead ends: 2312 [2023-11-29 00:03:36,337 INFO L226 Difference]: Without dead ends: 2312 [2023-11-29 00:03:36,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 00:03:36,338 INFO L413 NwaCegarLoop]: 788 mSDtfsCounter, 1304 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:36,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1499 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2060 Invalid, 0 Unknown, 1617 Unchecked, 5.0s Time] [2023-11-29 00:03:36,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2023-11-29 00:03:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1365. [2023-11-29 00:03:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 941 states have (on average 1.9883103081827842) internal successors, (1871), 1329 states have internal predecessors, (1871), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 00:03:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1932 transitions. [2023-11-29 00:03:36,368 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1932 transitions. Word has length 64 [2023-11-29 00:03:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:36,369 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1932 transitions. [2023-11-29 00:03:36,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1932 transitions. [2023-11-29 00:03:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 00:03:36,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:36,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:36,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 00:03:36,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:36,570 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:36,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1110857919, now seen corresponding path program 1 times [2023-11-29 00:03:36,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:36,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186760841] [2023-11-29 00:03:36,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:36,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:36,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:36,572 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:36,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 00:03:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:36,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:03:36,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:36,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:03:36,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:03:36,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 00:03:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:36,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:36,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186760841] [2023-11-29 00:03:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186760841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:36,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:36,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:03:36,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847478845] [2023-11-29 00:03:36,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:36,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:03:36,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:36,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:03:36,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:03:36,972 INFO L87 Difference]: Start difference. First operand 1365 states and 1932 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:03:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:40,996 INFO L93 Difference]: Finished difference Result 1376 states and 1944 transitions. [2023-11-29 00:03:40,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:03:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 00:03:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:41,000 INFO L225 Difference]: With dead ends: 1376 [2023-11-29 00:03:41,000 INFO L226 Difference]: Without dead ends: 1376 [2023-11-29 00:03:41,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:03:41,001 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 14 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:41,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3256 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:03:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-11-29 00:03:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1375. [2023-11-29 00:03:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.9841938883034773) internal successors, (1883), 1337 states have internal predecessors, (1883), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 00:03:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1944 transitions. [2023-11-29 00:03:41,019 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1944 transitions. Word has length 70 [2023-11-29 00:03:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1944 transitions. [2023-11-29 00:03:41,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:03:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1944 transitions. [2023-11-29 00:03:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 00:03:41,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:41,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:41,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 00:03:41,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:41,221 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:41,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 76857197, now seen corresponding path program 1 times [2023-11-29 00:03:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:41,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86151814] [2023-11-29 00:03:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:41,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:41,222 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:41,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 00:03:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:41,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:03:41,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:03:41,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:03:41,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:03:41,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 00:03:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:41,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:41,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86151814] [2023-11-29 00:03:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86151814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:41,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:03:41,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151467005] [2023-11-29 00:03:41,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:41,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:03:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:03:41,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:03:41,715 INFO L87 Difference]: Start difference. First operand 1375 states and 1944 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:47,334 INFO L93 Difference]: Finished difference Result 1375 states and 1942 transitions. [2023-11-29 00:03:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:03:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-11-29 00:03:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:47,339 INFO L225 Difference]: With dead ends: 1375 [2023-11-29 00:03:47,339 INFO L226 Difference]: Without dead ends: 1375 [2023-11-29 00:03:47,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:03:47,340 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 12 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:47,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3828 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-11-29 00:03:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-11-29 00:03:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2023-11-29 00:03:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.982086406743941) internal successors, (1881), 1337 states have internal predecessors, (1881), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 00:03:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1942 transitions. [2023-11-29 00:03:47,365 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1942 transitions. Word has length 71 [2023-11-29 00:03:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:47,365 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1942 transitions. [2023-11-29 00:03:47,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:03:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1942 transitions. [2023-11-29 00:03:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 00:03:47,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:47,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:47,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 00:03:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:47,567 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:47,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash -998618493, now seen corresponding path program 1 times [2023-11-29 00:03:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:47,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341938519] [2023-11-29 00:03:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:47,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:47,570 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:47,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 00:03:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:47,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:03:47,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:47,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:03:47,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341938519] [2023-11-29 00:03:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341938519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:03:47,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:03:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:03:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488115270] [2023-11-29 00:03:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:03:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:03:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:03:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:47,911 INFO L87 Difference]: Start difference. First operand 1375 states and 1942 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:03:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:48,963 INFO L93 Difference]: Finished difference Result 1383 states and 1952 transitions. [2023-11-29 00:03:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:03:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-11-29 00:03:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:48,969 INFO L225 Difference]: With dead ends: 1383 [2023-11-29 00:03:48,969 INFO L226 Difference]: Without dead ends: 1381 [2023-11-29 00:03:48,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:03:48,970 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 4 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:48,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2227 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:03:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2023-11-29 00:03:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2023-11-29 00:03:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 953 states have (on average 1.9800629590766001) internal successors, (1887), 1343 states have internal predecessors, (1887), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:03:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1950 transitions. [2023-11-29 00:03:48,996 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1950 transitions. Word has length 76 [2023-11-29 00:03:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:48,996 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1950 transitions. [2023-11-29 00:03:48,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:03:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1950 transitions. [2023-11-29 00:03:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 00:03:48,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:48,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:49,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 00:03:49,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:49,198 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:49,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152941, now seen corresponding path program 1 times [2023-11-29 00:03:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064915291] [2023-11-29 00:03:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:03:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:49,200 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:49,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 00:03:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:03:49,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:03:49,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:49,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:49,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064915291] [2023-11-29 00:03:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064915291] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:49,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:03:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 00:03:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598411009] [2023-11-29 00:03:49,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:49,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:03:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:03:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:03:49,693 INFO L87 Difference]: Start difference. First operand 1381 states and 1950 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:03:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:51,316 INFO L93 Difference]: Finished difference Result 1395 states and 1968 transitions. [2023-11-29 00:03:51,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:03:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-11-29 00:03:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:51,321 INFO L225 Difference]: With dead ends: 1395 [2023-11-29 00:03:51,322 INFO L226 Difference]: Without dead ends: 1391 [2023-11-29 00:03:51,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:03:51,322 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 27 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:51,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2967 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:03:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-29 00:03:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-11-29 00:03:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 961 states have (on average 1.9739854318418315) internal successors, (1897), 1351 states have internal predecessors, (1897), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:03:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1960 transitions. [2023-11-29 00:03:51,347 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1960 transitions. Word has length 77 [2023-11-29 00:03:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:51,348 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1960 transitions. [2023-11-29 00:03:51,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:03:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1960 transitions. [2023-11-29 00:03:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 00:03:51,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:51,349 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:51,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 00:03:51,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:51,550 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:51,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash -239229693, now seen corresponding path program 2 times [2023-11-29 00:03:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914249444] [2023-11-29 00:03:51,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:03:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:51,552 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:51,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 00:03:52,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:03:52,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:52,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:03:52,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:52,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:52,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914249444] [2023-11-29 00:03:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914249444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:52,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:03:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 00:03:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663400964] [2023-11-29 00:03:52,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:52,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:03:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:52,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:03:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:03:52,527 INFO L87 Difference]: Start difference. First operand 1389 states and 1960 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:03:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:03:55,469 INFO L93 Difference]: Finished difference Result 1413 states and 1998 transitions. [2023-11-29 00:03:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:03:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2023-11-29 00:03:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:03:55,473 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 00:03:55,473 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 00:03:55,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2023-11-29 00:03:55,474 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 32 mSDsluCounter, 5184 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:03:55,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5929 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 00:03:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 00:03:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1407. [2023-11-29 00:03:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 979 states have (on average 1.9622063329928499) internal successors, (1921), 1369 states have internal predecessors, (1921), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:03:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1984 transitions. [2023-11-29 00:03:55,495 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1984 transitions. Word has length 80 [2023-11-29 00:03:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:03:55,496 INFO L495 AbstractCegarLoop]: Abstraction has 1407 states and 1984 transitions. [2023-11-29 00:03:55,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:03:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1984 transitions. [2023-11-29 00:03:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:03:55,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:03:55,497 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:55,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:03:55,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:55,698 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:03:55,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1517835459, now seen corresponding path program 3 times [2023-11-29 00:03:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:55,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741557787] [2023-11-29 00:03:55,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:03:55,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:55,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:55,700 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:55,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 00:03:56,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:03:56,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:56,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:03:56,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:56,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:57,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741557787] [2023-11-29 00:03:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741557787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:57,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:03:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 00:03:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687664569] [2023-11-29 00:03:57,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:57,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 00:03:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 00:03:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:03:57,942 INFO L87 Difference]: Start difference. First operand 1407 states and 1984 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:04:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:06,664 INFO L93 Difference]: Finished difference Result 1449 states and 2056 transitions. [2023-11-29 00:04:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:04:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 86 [2023-11-29 00:04:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:06,668 INFO L225 Difference]: With dead ends: 1449 [2023-11-29 00:04:06,668 INFO L226 Difference]: Without dead ends: 1443 [2023-11-29 00:04:06,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 00:04:06,670 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 69 mSDsluCounter, 8891 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 9636 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:06,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 9636 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 00:04:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2023-11-29 00:04:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2023-11-29 00:04:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1015 states have (on average 1.9379310344827587) internal successors, (1967), 1405 states have internal predecessors, (1967), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:04:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2030 transitions. [2023-11-29 00:04:06,690 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2030 transitions. Word has length 86 [2023-11-29 00:04:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:06,690 INFO L495 AbstractCegarLoop]: Abstraction has 1443 states and 2030 transitions. [2023-11-29 00:04:06,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:04:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2030 transitions. [2023-11-29 00:04:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 00:04:06,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:06,692 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:06,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 00:04:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:06,892 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:04:06,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1951482947, now seen corresponding path program 4 times [2023-11-29 00:04:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:06,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488323006] [2023-11-29 00:04:06,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:04:06,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:06,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:06,895 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:04:06,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 00:04:07,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:04:07,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:07,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 00:04:07,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:08,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:04:10,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488323006] [2023-11-29 00:04:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488323006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:04:10,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:04:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-11-29 00:04:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390727033] [2023-11-29 00:04:10,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:10,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 00:04:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 00:04:10,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 00:04:10,513 INFO L87 Difference]: Start difference. First operand 1443 states and 2030 transitions. Second operand has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:04:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:28,729 INFO L93 Difference]: Finished difference Result 1517 states and 2168 transitions. [2023-11-29 00:04:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 00:04:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2023-11-29 00:04:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:28,734 INFO L225 Difference]: With dead ends: 1517 [2023-11-29 00:04:28,734 INFO L226 Difference]: Without dead ends: 1513 [2023-11-29 00:04:28,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2023-11-29 00:04:28,738 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 127 mSDsluCounter, 17783 mSDsCounter, 0 mSdLazyCounter, 3924 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 18528 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:28,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 18528 Invalid, 3974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 3924 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 00:04:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-29 00:04:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2023-11-29 00:04:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1083 states have (on average 1.9012003693444137) internal successors, (2059), 1473 states have internal predecessors, (2059), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:04:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2122 transitions. [2023-11-29 00:04:28,759 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2122 transitions. Word has length 98 [2023-11-29 00:04:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:28,759 INFO L495 AbstractCegarLoop]: Abstraction has 1511 states and 2122 transitions. [2023-11-29 00:04:28,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:04:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2122 transitions. [2023-11-29 00:04:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:04:28,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:28,760 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:28,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 00:04:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:28,961 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:04:28,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash -487952893, now seen corresponding path program 5 times [2023-11-29 00:04:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191471253] [2023-11-29 00:04:28,962 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:04:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:28,963 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:04:28,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 00:04:30,526 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:04:30,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:30,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 00:04:30,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:30,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:04:30,696 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:04:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:04:30,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:04:30,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:04:32,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:32,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:32,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:04:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:04:32,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:32,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2694) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:04:32,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191471253] [2023-11-29 00:04:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191471253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51692919] [2023-11-29 00:04:32,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:04:32,668 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:04:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:04:32,668 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:04:32,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 00:05:38,656 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:05:38,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:05:38,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 00:05:38,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:05:38,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:05:39,183 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:05:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:05:39,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:05:39,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:05:40,514 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:05:40,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:05:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:05:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:05:40,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:05:41,024 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:05:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [51692919] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:05:41,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:05:41,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2023-11-29 00:05:41,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135484931] [2023-11-29 00:05:41,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:05:41,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:05:41,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:05:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:05:41,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=283, Unknown=2, NotChecked=70, Total=420 [2023-11-29 00:05:41,027 INFO L87 Difference]: Start difference. First operand 1511 states and 2122 transitions. Second operand has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:05:45,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:05:49,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:05:53,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:05:57,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:06:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:06:06,650 INFO L93 Difference]: Finished difference Result 1892 states and 2626 transitions. [2023-11-29 00:06:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:06:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 120 [2023-11-29 00:06:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:06:06,653 INFO L225 Difference]: With dead ends: 1892 [2023-11-29 00:06:06,653 INFO L226 Difference]: Without dead ends: 1892 [2023-11-29 00:06:06,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=458, Unknown=2, NotChecked=90, Total=650 [2023-11-29 00:06:06,653 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 737 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 5033 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5033 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:06:06,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 4005 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5033 Invalid, 4 Unknown, 0 Unchecked, 25.4s Time] [2023-11-29 00:06:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2023-11-29 00:06:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1508. [2023-11-29 00:06:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1083 states have (on average 1.8956602031394276) internal successors, (2053), 1470 states have internal predecessors, (2053), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:06:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2116 transitions. [2023-11-29 00:06:06,673 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2116 transitions. Word has length 120 [2023-11-29 00:06:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:06:06,674 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2116 transitions. [2023-11-29 00:06:06,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:06:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2116 transitions. [2023-11-29 00:06:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 00:06:06,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:06:06,675 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:06:06,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 00:06:06,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 00:06:07,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:06:07,075 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:06:07,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:06:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -487952892, now seen corresponding path program 1 times [2023-11-29 00:06:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:06:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607352043] [2023-11-29 00:06:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:06:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:06:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:06:07,080 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:06:07,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 00:06:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:06:07,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 00:06:07,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:06:07,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:06:08,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:06:08,111 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:06:08,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:06:08,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:06:08,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:06:08,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:06:08,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:06:09,159 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:06:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:06:09,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:06:09,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:06:09,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:06:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:06:09,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:06:10,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3744 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3744) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3744 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3744) |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 00:06:10,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:06:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607352043] [2023-11-29 00:06:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607352043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:06:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1157394246] [2023-11-29 00:06:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:06:10,696 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:06:10,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:06:10,697 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:06:10,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 00:07:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:54,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 00:07:54,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:07:54,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:07:55,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:07:55,188 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:07:55,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:07:55,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:07:55,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:07:55,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:07:55,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:07:56,130 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:07:56,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:07:56,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:07:56,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:07:56,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:07:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:07:56,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:07:57,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4314 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4315) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4314) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:07:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1157394246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:07:57,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:07:57,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-11-29 00:07:57,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233304832] [2023-11-29 00:07:57,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:07:57,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:07:57,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:07:57,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:07:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=203, Unknown=2, NotChecked=58, Total=306 [2023-11-29 00:07:57,780 INFO L87 Difference]: Start difference. First operand 1508 states and 2116 transitions. Second operand has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:08:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:08:15,172 INFO L93 Difference]: Finished difference Result 2026 states and 2831 transitions. [2023-11-29 00:08:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:08:15,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 120 [2023-11-29 00:08:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:08:15,176 INFO L225 Difference]: With dead ends: 2026 [2023-11-29 00:08:15,177 INFO L226 Difference]: Without dead ends: 2026 [2023-11-29 00:08:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=423, Unknown=2, NotChecked=86, Total=600 [2023-11-29 00:08:15,177 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 507 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 6942 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 6962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:08:15,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 5075 Invalid, 6962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6942 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2023-11-29 00:08:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2023-11-29 00:08:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1507. [2023-11-29 00:08:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1083 states have (on average 1.8938134810710987) internal successors, (2051), 1469 states have internal predecessors, (2051), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:08:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2114 transitions. [2023-11-29 00:08:15,196 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2114 transitions. Word has length 120 [2023-11-29 00:08:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:08:15,196 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 2114 transitions. [2023-11-29 00:08:15,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:08:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2114 transitions. [2023-11-29 00:08:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:08:15,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:08:15,197 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:08:15,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 00:08:15,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 00:08:15,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:08:15,598 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:08:15,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:08:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash -769932828, now seen corresponding path program 1 times [2023-11-29 00:08:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:08:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191026039] [2023-11-29 00:08:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:08:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:08:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:08:15,601 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:08:15,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 00:08:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:08:16,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 00:08:16,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:08:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:08:16,749 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:08:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:08:16,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:08:16,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:08:18,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:08:18,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:08:18,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:08:18,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:08:18,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:08:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:08:18,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:08:22,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4755 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:08:23,017 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4801 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4801))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4755)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:08:23,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:08:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191026039] [2023-11-29 00:08:23,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191026039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:08:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [289009853] [2023-11-29 00:08:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:08:23,021 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:08:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:08:23,022 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:08:23,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 00:08:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:08:28,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 00:08:28,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:08:28,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:08:28,475 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:08:28,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:08:28,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:08:28,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:08:30,019 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:08:30,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:08:30,223 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:08:30,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:08:30,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:08:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:08:30,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:08:30,270 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5241) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:08:30,283 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5241 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5241) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:08:30,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5287 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5287))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5241)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:08:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [289009853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:08:30,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:08:30,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-11-29 00:08:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634311372] [2023-11-29 00:08:30,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:08:30,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:08:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:08:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:08:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=388, Unknown=6, NotChecked=220, Total=702 [2023-11-29 00:08:30,826 INFO L87 Difference]: Start difference. First operand 1507 states and 2114 transitions. Second operand has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:08:35,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:08:39,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:08:43,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:08:47,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:08:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:08:58,166 INFO L93 Difference]: Finished difference Result 1890 states and 2622 transitions. [2023-11-29 00:08:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:08:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 122 [2023-11-29 00:08:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:08:58,169 INFO L225 Difference]: With dead ends: 1890 [2023-11-29 00:08:58,170 INFO L226 Difference]: Without dead ends: 1890 [2023-11-29 00:08:58,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=123, Invalid=593, Unknown=6, NotChecked=270, Total=992 [2023-11-29 00:08:58,171 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 733 mSDsluCounter, 3629 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:08:58,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4020 Invalid, 5104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5078 Invalid, 4 Unknown, 0 Unchecked, 27.1s Time] [2023-11-29 00:08:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2023-11-29 00:08:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1506. [2023-11-29 00:08:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1083 states have (on average 1.89196675900277) internal successors, (2049), 1468 states have internal predecessors, (2049), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 00:08:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2112 transitions. [2023-11-29 00:08:58,188 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2112 transitions. Word has length 122 [2023-11-29 00:08:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:08:58,189 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2112 transitions. [2023-11-29 00:08:58,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:08:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2112 transitions. [2023-11-29 00:08:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 00:08:58,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:08:58,190 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:08:58,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:08:58,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-11-29 00:08:58,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:08:58,591 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:08:58,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:08:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -769932827, now seen corresponding path program 1 times [2023-11-29 00:08:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:08:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249333111] [2023-11-29 00:08:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:08:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:08:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:08:58,593 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:08:58,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 00:08:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:08:59,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 00:08:59,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:08:59,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:08:59,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:09:00,022 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:09:00,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:09:00,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:09:00,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:09:00,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:09:00,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:09:01,351 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:09:01,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:09:01,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:09:01,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:09:01,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:09:01,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:09:01,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:09:01,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:09:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:09:01,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:09:01,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 00:09:01,872 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_5773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:09:03,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5865))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5866) .cse0 v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5774 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5866) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 00:09:03,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:09:03,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249333111] [2023-11-29 00:09:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249333111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:09:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [791708245] [2023-11-29 00:09:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:03,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:09:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:09:03,678 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:09:03,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 00:09:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:10,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 00:09:10,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:09:10,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:09:10,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:09:11,101 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:09:11,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:09:11,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:09:11,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:09:11,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:09:11,339 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 16 treesize of output 8 [2023-11-29 00:09:11,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:09:12,463 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 16 treesize of output 11 [2023-11-29 00:09:12,779 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2023-11-29 00:09:12,792 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 35 treesize of output 11 [2023-11-29 00:09:12,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 17 treesize of output 9 [2023-11-29 00:09:12,953 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 7 treesize of output 3 [2023-11-29 00:09:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:09:13,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:09:13,500 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 231 treesize of output 159 [2023-11-29 00:09:16,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_77 (_ BitVec 32)) (v_ArrVal_6358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6358))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse1 (select |c_#length| v_arrayElimCell_77))) (or (forall ((v_prenex_6 (_ BitVec 32)) (v_ArrVal_6309 (_ BitVec 32))) (let ((.cse0 (bvadd (select (select (store .cse2 v_arrayElimCell_77 (store (select .cse2 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse3) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv8 32)))) (or (bvule .cse0 .cse1) (bvule .cse0 (select |c_#length| v_ArrVal_6309))))) (not (bvule (bvadd .cse3 (_ bv20 32)) .cse1)))))) (forall ((v_ArrVal_6358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6358))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_77 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse7 (select |c_#length| v_arrayElimCell_77))) (or (bvule (bvadd (select (select (store .cse5 v_arrayElimCell_77 (store (select .cse5 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse6) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv8 32)) .cse7) (not (bvule (bvadd .cse6 (_ bv20 32)) .cse7))))) (= (bvadd (_ bv8 32) .cse6) |c_ULTIMATE.start_main_~user~0#1.offset|))))) (forall ((v_arrayElimCell_77 (_ BitVec 32)) (v_ArrVal_6358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6358))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse10 (select |c_#length| v_arrayElimCell_77))) (or (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_77) (forall ((v_prenex_6 (_ BitVec 32))) (bvule (bvadd (select (select (store .cse8 v_arrayElimCell_77 (store (select .cse8 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse9) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv8 32)) .cse10)) (not (bvule (bvadd .cse9 (_ bv20 32)) .cse10)))))) (forall ((v_ArrVal_6358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6358) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse11 (select .cse12 .cse4))) (or (not (bvule (bvadd .cse11 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))) (forall ((v_prenex_6 (_ BitVec 32)) (v_ArrVal_6309 (_ BitVec 32))) (bvule (bvadd (select (store .cse12 (bvadd (_ bv16 32) .cse11) v_prenex_6) .cse4) (_ bv8 32)) (select |c_#length| v_ArrVal_6309))) (not (= (bvadd (_ bv8 32) .cse11) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) (forall ((v_arrayElimCell_77 (_ BitVec 32)) (v_ArrVal_6358 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6358))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (forall ((v_ArrVal_6310 (_ BitVec 32))) (let ((.cse13 (select (select (store .cse14 v_arrayElimCell_77 (store (select .cse14 v_arrayElimCell_77) (bvadd (_ bv16 32) .cse15) v_ArrVal_6310)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse13) (bvadd (_ bv8 32) .cse13)))) (not (bvule (bvadd .cse15 (_ bv20 32)) (select |c_#length| v_arrayElimCell_77))))))))) is different from false [2023-11-29 00:09:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [791708245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:09:17,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:09:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-11-29 00:09:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230182344] [2023-11-29 00:09:17,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:09:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 00:09:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:09:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 00:09:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=962, Unknown=4, NotChecked=260, Total=1332 [2023-11-29 00:09:17,095 INFO L87 Difference]: Start difference. First operand 1506 states and 2112 transitions. Second operand has 29 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:09:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:09:51,791 INFO L93 Difference]: Finished difference Result 2063 states and 2871 transitions. [2023-11-29 00:09:51,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 00:09:51,792 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 122 [2023-11-29 00:09:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:09:51,794 INFO L225 Difference]: With dead ends: 2063 [2023-11-29 00:09:51,794 INFO L226 Difference]: Without dead ends: 2063 [2023-11-29 00:09:51,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=226, Invalid=1856, Unknown=4, NotChecked=364, Total=2450 [2023-11-29 00:09:51,795 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 1061 mSDsluCounter, 7648 mSDsCounter, 0 mSdLazyCounter, 13789 mSolverCounterSat, 60 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 8422 SdHoareTripleChecker+Invalid, 13863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13789 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:09:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 8422 Invalid, 13863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 13789 Invalid, 14 Unknown, 0 Unchecked, 32.8s Time] [2023-11-29 00:09:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2023-11-29 00:09:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1740. [2023-11-29 00:09:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1309 states have (on average 1.9060351413292589) internal successors, (2495), 1696 states have internal predecessors, (2495), 38 states have call successors, (38), 22 states have call predecessors, (38), 19 states have return successors, (37), 24 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 00:09:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2570 transitions. [2023-11-29 00:09:51,812 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2570 transitions. Word has length 122 [2023-11-29 00:09:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:09:51,812 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2570 transitions. [2023-11-29 00:09:51,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:09:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2570 transitions. [2023-11-29 00:09:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:09:51,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:51,813 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:09:51,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 00:09:52,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 00:09:52,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:09:52,214 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:09:52,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715296, now seen corresponding path program 1 times [2023-11-29 00:09:52,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:09:52,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959826279] [2023-11-29 00:09:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:52,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:09:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:09:52,216 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:09:52,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 00:09:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:09:53,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 00:09:53,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:09:53,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:09:53,474 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:09:53,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:09:53,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:09:53,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:09:54,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:09:54,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:09:55,078 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:09:55,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:09:55,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:09:55,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:09:55,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:09:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:09:55,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:09:55,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_6814) |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 00:09:55,397 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6814 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6814) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:09:55,412 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:09:55,426 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6813))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:09:55,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6860 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6813)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6814)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:09:55,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:09:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959826279] [2023-11-29 00:09:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959826279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:09:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701804958] [2023-11-29 00:09:55,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:55,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:09:55,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:09:55,879 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:09:55,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 00:10:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:00,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 00:10:00,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:10:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:10:00,648 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:10:00,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:10:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:10:00,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:10:02,070 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:10:02,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:10:02,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:10:02,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 36 treesize of output 35 [2023-11-29 00:10:02,407 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:10:02,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:10:02,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:10:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:10:02,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:10:02,450 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7316) |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 00:10:02,463 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7316 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7316) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:10:02,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:10:02,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7315))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:10:02,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7315 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7362))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7315)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7316)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:10:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [701804958] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:10:02,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:10:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-11-29 00:10:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596516523] [2023-11-29 00:10:02,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:10:02,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 00:10:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:10:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:10:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=429, Unknown=10, NotChecked=510, Total=1056 [2023-11-29 00:10:02,969 INFO L87 Difference]: Start difference. First operand 1740 states and 2570 transitions. Second operand has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:07,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:10:11,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:10:15,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:10:19,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:10:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:10:31,245 INFO L93 Difference]: Finished difference Result 2123 states and 3078 transitions. [2023-11-29 00:10:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:10:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-11-29 00:10:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:10:31,247 INFO L225 Difference]: With dead ends: 2123 [2023-11-29 00:10:31,247 INFO L226 Difference]: Without dead ends: 2123 [2023-11-29 00:10:31,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=644, Unknown=10, NotChecked=610, Total=1406 [2023-11-29 00:10:31,248 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 727 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 5522 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 5549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5522 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:10:31,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4379 Invalid, 5549 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5522 Invalid, 4 Unknown, 0 Unchecked, 28.0s Time] [2023-11-29 00:10:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2023-11-29 00:10:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 1739. [2023-11-29 00:10:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1309 states have (on average 1.9045072574484339) internal successors, (2493), 1695 states have internal predecessors, (2493), 38 states have call successors, (38), 22 states have call predecessors, (38), 19 states have return successors, (37), 24 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 00:10:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2568 transitions. [2023-11-29 00:10:31,264 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2568 transitions. Word has length 124 [2023-11-29 00:10:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:10:31,265 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2568 transitions. [2023-11-29 00:10:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:10:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2568 transitions. [2023-11-29 00:10:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 00:10:31,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:31,265 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:31,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:10:31,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 00:10:31,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:10:31,666 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:10:31,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715295, now seen corresponding path program 1 times [2023-11-29 00:10:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:10:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393616252] [2023-11-29 00:10:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:31,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:10:31,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:10:31,668 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:10:31,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 00:10:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:32,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 00:10:32,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:10:32,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:10:32,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:10:32,990 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:10:32,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:10:33,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:10:33,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:10:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:10:33,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:10:34,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:10:34,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:10:34,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 30 treesize of output 13 [2023-11-29 00:10:34,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:10:34,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:10:34,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:10:34,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:10:34,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:10:34,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:10:34,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:10:34,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:10:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:10:34,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:10:34,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7866) |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 00:10:35,000 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:10:35,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7863) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7864))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7863) .cse2 v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:10:35,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_7864))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7863) .cse1 v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7863) (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 00:10:37,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7957))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7864))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7958) .cse0 v_ArrVal_7863) .cse1 v_ArrVal_7866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7957))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7958) .cse6 v_ArrVal_7863) (select (select (store .cse7 .cse6 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7866))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 00:10:37,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:10:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393616252] [2023-11-29 00:10:37,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393616252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:10:37,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1480814676] [2023-11-29 00:10:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:37,475 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:10:37,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:10:37,476 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:10:37,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 00:13:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:09,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-29 00:13:09,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:09,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:13:09,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:13:09,754 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:13:09,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:13:09,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:13:09,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:13:10,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:13:10,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:13:11,480 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:13:11,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:13:11,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:13:11,774 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:13:11,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:13:11,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:13:11,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:13:11,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:13:11,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:13:11,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:13:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:13:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:13:12,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:12,074 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8462) |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 00:13:12,115 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8462) |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 00:13:12,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8460))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8459) .cse0 v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8459) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 00:13:12,212 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8459) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8460))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8459) .cse3 v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 00:13:13,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8554))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8553) .cse1 v_ArrVal_8459) (select (select (store .cse2 .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8462))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8554))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8460))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8553) .cse4 v_ArrVal_8459) .cse5 v_ArrVal_8462) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:13:13,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1480814676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:13,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:13:13,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-11-29 00:13:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519505066] [2023-11-29 00:13:13,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:13:13,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 00:13:13,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:13:13,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 00:13:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=487, Unknown=10, NotChecked=530, Total=1122 [2023-11-29 00:13:13,752 INFO L87 Difference]: Start difference. First operand 1739 states and 2568 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:13:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:13:53,226 INFO L93 Difference]: Finished difference Result 2431 states and 3371 transitions. [2023-11-29 00:13:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:13:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-11-29 00:13:53,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:13:53,229 INFO L225 Difference]: With dead ends: 2431 [2023-11-29 00:13:53,229 INFO L226 Difference]: Without dead ends: 2431 [2023-11-29 00:13:53,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=168, Invalid=918, Unknown=10, NotChecked=710, Total=1806 [2023-11-29 00:13:53,230 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 1181 mSDsluCounter, 4597 mSDsCounter, 0 mSdLazyCounter, 12151 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 5215 SdHoareTripleChecker+Invalid, 12179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:13:53,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 5215 Invalid, 12179 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 12151 Invalid, 0 Unknown, 0 Unchecked, 38.6s Time] [2023-11-29 00:13:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2023-11-29 00:13:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1738. [2023-11-29 00:13:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1309 states have (on average 1.9029793735676088) internal successors, (2491), 1694 states have internal predecessors, (2491), 38 states have call successors, (38), 22 states have call predecessors, (38), 19 states have return successors, (37), 24 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 00:13:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2566 transitions. [2023-11-29 00:13:53,253 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2566 transitions. Word has length 124 [2023-11-29 00:13:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:13:53,254 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 2566 transitions. [2023-11-29 00:13:53,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:13:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2566 transitions. [2023-11-29 00:13:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:13:53,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:13:53,255 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:53,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 00:13:53,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-29 00:13:53,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:13:53,656 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:13:53,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384054, now seen corresponding path program 1 times [2023-11-29 00:13:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:13:53,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189668522] [2023-11-29 00:13:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:53,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:13:53,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:13:53,658 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:13:53,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 00:13:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:54,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 00:13:54,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:13:54,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 00:13:55,206 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:13:55,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:13:55,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:13:55,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:13:57,085 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:13:57,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:13:57,274 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:13:57,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:13:57,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:13:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:13:57,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:13:57,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:13:57,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:13:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:13:57,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:13:57,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9026) |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 00:13:57,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9026 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:13:57,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9025 (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$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9025))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:13:57,838 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9025 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9025))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:13:57,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9025 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9024))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9025)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:13:57,881 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9025 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9024))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9025)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:13:58,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9026 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9025 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9072))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9024)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9025)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9026)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:13:58,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:13:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189668522] [2023-11-29 00:13:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189668522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:13:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [670739639] [2023-11-29 00:13:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:13:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:13:58,463 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:13:58,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 00:14:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:05,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 00:14:05,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:05,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:05,883 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:14:05,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:14:05,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:14:06,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:14:07,810 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:07,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:14:08,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:08,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:14:08,253 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:08,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:14:08,424 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:08,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:14:08,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:14:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:14:08,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:12,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9544) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 00:14:12,638 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (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$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9543))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:14:12,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:14:12,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9542 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9542))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:14:12,716 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9542 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9542))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:14:13,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9590))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9542)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9543)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9544)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:14:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [670739639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:14:13,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:14:13,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-11-29 00:14:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16917326] [2023-11-29 00:14:13,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:13,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:14:13,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:14:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=553, Unknown=19, NotChecked=780, Total=1482 [2023-11-29 00:14:13,254 INFO L87 Difference]: Start difference. First operand 1738 states and 2566 transitions. Second operand has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:14:18,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:14:22,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:14:26,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:14:30,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:14:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:51,353 INFO L93 Difference]: Finished difference Result 2121 states and 3074 transitions. [2023-11-29 00:14:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:14:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 126 [2023-11-29 00:14:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:51,356 INFO L225 Difference]: With dead ends: 2121 [2023-11-29 00:14:51,356 INFO L226 Difference]: Without dead ends: 2121 [2023-11-29 00:14:51,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=165, Invalid=798, Unknown=19, NotChecked=910, Total=1892 [2023-11-29 00:14:51,357 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 1349 mSDsluCounter, 5153 mSDsCounter, 0 mSdLazyCounter, 7144 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 5542 SdHoareTripleChecker+Invalid, 7176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7144 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:51,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 5542 Invalid, 7176 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7144 Invalid, 4 Unknown, 0 Unchecked, 37.6s Time] [2023-11-29 00:14:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2023-11-29 00:14:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1737. [2023-11-29 00:14:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1309 states have (on average 1.9014514896867838) internal successors, (2489), 1693 states have internal predecessors, (2489), 38 states have call successors, (38), 22 states have call predecessors, (38), 19 states have return successors, (37), 24 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 00:14:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2564 transitions. [2023-11-29 00:14:51,379 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2564 transitions. Word has length 126 [2023-11-29 00:14:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:51,380 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 2564 transitions. [2023-11-29 00:14:51,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:14:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2564 transitions. [2023-11-29 00:14:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 00:14:51,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:51,381 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:51,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 00:14:51,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 00:14:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:51,782 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 00:14:51,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384055, now seen corresponding path program 1 times [2023-11-29 00:14:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971816164] [2023-11-29 00:14:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:51,784 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:51,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 00:14:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:52,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-29 00:14:52,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:52,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:53,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:14:53,470 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:14:53,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:14:53,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 00:14:53,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:14:53,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:14:53,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:14:55,115 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:55,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:14:55,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:14:55,320 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:55,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:14:55,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:14:55,468 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:55,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:14:55,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:14:55,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:55,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:14:55,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:14:55,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:14:55,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:14:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 00:14:55,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:55,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 00:14:56,021 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 00:14:56,100 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10108))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10109) .cse0 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10109) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10111) |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 00:14:56,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_10108))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10109) .cse1 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10109) (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_10108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 00:14:56,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10107))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10108))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10106) .cse0 v_ArrVal_10109) .cse1 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10107))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10106) .cse6 v_ArrVal_10109) (select (select (store .cse7 .cse6 v_ArrVal_10108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10111))) |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 00:14:58,416 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10107))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10106) .cse2 v_ArrVal_10109) (select (select (store .cse3 .cse2 v_ArrVal_10108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10111))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10107))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10108))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10106) .cse5 v_ArrVal_10109) .cse6 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 00:15:04,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10203))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10107))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10108))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10202) .cse0 v_ArrVal_10106) .cse1 v_ArrVal_10109) .cse2 v_ArrVal_10111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10202 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10203))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10107))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10202) .cse8 v_ArrVal_10106) .cse9 v_ArrVal_10109) (select (select (store .cse10 .cse9 v_ArrVal_10108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10111))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 00:15:04,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:15:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971816164] [2023-11-29 00:15:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971816164] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1108130726] [2023-11-29 00:15:04,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:15:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:15:04,414 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:15:04,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b70cc301-ab69-4bf8-8aa8-11bb576a786a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process