./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/seq-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/seq-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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 64bit --witnessprinter.graph.data.programhash e95467ef6cafcd26f4031a69e00febdc919d3c7174794600f70cac578001ccfd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:25:03,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:25:03,113 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 00:25:03,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:25:03,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:25:03,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:25:03,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:25:03,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:25:03,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:25:03,152 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:25:03,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:25:03,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:25:03,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:25:03,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:25:03,154 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:25:03,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:25:03,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:25:03,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:25:03,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:25:03,157 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:25:03,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:25:03,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:25:03,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:25:03,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:25:03,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:25:03,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:25:03,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:25:03,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:25:03,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:25:03,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:25:03,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:25:03,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:25:03,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:25:03,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:25:03,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:25:03,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:25:03,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:25:03,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:25:03,165 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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e95467ef6cafcd26f4031a69e00febdc919d3c7174794600f70cac578001ccfd [2023-11-29 00:25:03,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:25:03,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:25:03,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:25:03,422 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:25:03,423 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:25:03,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/seq-1.i [2023-11-29 00:25:06,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:25:06,411 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:25:06,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/sv-benchmarks/c/busybox-1.22.0/seq-1.i [2023-11-29 00:25:06,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/3d685e7bf/a3a02251efec4a8abffb21944dac8f28/FLAG63940368e [2023-11-29 00:25:06,449 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/3d685e7bf/a3a02251efec4a8abffb21944dac8f28 [2023-11-29 00:25:06,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:25:06,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:25:06,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:06,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:25:06,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:25:06,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:06" (1/1) ... [2023-11-29 00:25:06,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2329d92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:06, skipping insertion in model container [2023-11-29 00:25:06,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:06" (1/1) ... [2023-11-29 00:25:06,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:25:07,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:07,573 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:25:07,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@457a8e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:07, skipping insertion in model container [2023-11-29 00:25:07,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:07,574 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:25:07,575 INFO L158 Benchmark]: Toolchain (without parser) took 1121.43ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 105.3MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-29 00:25:07,576 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:25:07,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1119.44ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 105.3MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-29 00:25:07,578 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1119.44ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 105.3MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2208]: 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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/seq-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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 64bit --witnessprinter.graph.data.programhash e95467ef6cafcd26f4031a69e00febdc919d3c7174794600f70cac578001ccfd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:25:09,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:25:09,381 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-29 00:25:09,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:25:09,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:25:09,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:25:09,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:25:09,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:25:09,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:25:09,426 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:25:09,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:25:09,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:25:09,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:25:09,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:25:09,429 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:25:09,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:25:09,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:25:09,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:25:09,431 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:25:09,431 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:25:09,432 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:25:09,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:25:09,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:25:09,433 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:25:09,434 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:25:09,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:25:09,435 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:25:09,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:25:09,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:25:09,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:25:09,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:25:09,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:25:09,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:25:09,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:25:09,438 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:25:09,438 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:25:09,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:25:09,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:25:09,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:25:09,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:25:09,441 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:25:09,443 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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e95467ef6cafcd26f4031a69e00febdc919d3c7174794600f70cac578001ccfd [2023-11-29 00:25:09,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:25:09,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:25:09,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:25:09,745 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:25:09,746 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:25:09,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/seq-1.i [2023-11-29 00:25:12,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:25:12,880 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:25:12,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/sv-benchmarks/c/busybox-1.22.0/seq-1.i [2023-11-29 00:25:12,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/5c7a12dda/e44f3f01b73a41f880d5342f3dcd0dcd/FLAG889c37de2 [2023-11-29 00:25:12,925 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/data/5c7a12dda/e44f3f01b73a41f880d5342f3dcd0dcd [2023-11-29 00:25:12,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:25:12,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:25:12,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:12,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:25:12,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:25:12,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:12" (1/1) ... [2023-11-29 00:25:12,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb7d686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:12, skipping insertion in model container [2023-11-29 00:25:12,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:12" (1/1) ... [2023-11-29 00:25:13,005 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:25:14,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:14,051 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:25:14,078 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:25:14,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:14,195 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:25:14,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:14,466 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:25:14,466 WARN L675 CHandler]: The function putchar is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:25:14,466 WARN L675 CHandler]: The function strtoul is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:25:14,473 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:25:14,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14 WrapperNode [2023-11-29 00:25:14,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:14,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:25:14,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:25:14,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:25:14,480 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:25:14" (1/1) ... [2023-11-29 00:25:14,536 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:25:14" (1/1) ... [2023-11-29 00:25:14,605 INFO L138 Inliner]: procedures = 583, calls = 363, calls flagged for inlining = 23, calls inlined = 22, statements flattened = 1452 [2023-11-29 00:25:14,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:25:14,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:25:14,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:25:14,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:25:14,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,667 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-29 00:25:14,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:25:14,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:25:14,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:25:14,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:25:14,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (1/1) ... [2023-11-29 00:25:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:25:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:25:14,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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:25:14,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/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:25:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2023-11-29 00:25:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:25:14,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-29 00:25:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-29 00:25:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-29 00:25:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:25:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:25:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-29 00:25:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-29 00:25:14,845 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-29 00:25:14,845 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2023-11-29 00:25:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-29 00:25:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:25:14,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:25:14,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2023-11-29 00:25:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 00:25:14,847 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2023-11-29 00:25:14,847 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-11-29 00:25:14,848 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2023-11-29 00:25:14,848 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2023-11-29 00:25:15,241 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:25:15,243 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:25:20,772 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:25:26,204 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:25:26,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:25:26,389 INFO L309 CfgBuilder]: Removed 28 assume(true) statements. [2023-11-29 00:25:26,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:25:26 BoogieIcfgContainer [2023-11-29 00:25:26,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:25:26,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:25:26,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:25:26,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:25:26,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:25:12" (1/3) ... [2023-11-29 00:25:26,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fb9a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:25:26, skipping insertion in model container [2023-11-29 00:25:26,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:14" (2/3) ... [2023-11-29 00:25:26,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fb9a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:25:26, skipping insertion in model container [2023-11-29 00:25:26,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:25:26" (3/3) ... [2023-11-29 00:25:26,399 INFO L112 eAbstractionObserver]: Analyzing ICFG seq-1.i [2023-11-29 00:25:26,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:25:26,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 452 error locations. [2023-11-29 00:25:26,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:25:26,486 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;@7aee1ba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:25:26,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 452 error locations. [2023-11-29 00:25:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 974 states, 495 states have (on average 2.2626262626262625) internal successors, (1120), 946 states have internal predecessors, (1120), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 00:25:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:25:26,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:26,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:25:26,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:25:26,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 65758, now seen corresponding path program 1 times [2023-11-29 00:25:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:25:26,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057555615] [2023-11-29 00:25:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:26,524 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:25:26,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:25:26,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:26,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:26,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:25:26,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:25:26,904 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:25:26,924 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:25:26,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:25:26,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:25:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057555615] [2023-11-29 00:25:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057555615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:25:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936670949] [2023-11-29 00:25:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:26,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:25:26,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:25:26,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:25:26,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:25:26,965 INFO L87 Difference]: Start difference. First operand has 974 states, 495 states have (on average 2.2626262626262625) internal successors, (1120), 946 states have internal predecessors, (1120), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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:25:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:30,401 INFO L93 Difference]: Finished difference Result 1120 states and 1302 transitions. [2023-11-29 00:25:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:25:30,403 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:25:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:30,417 INFO L225 Difference]: With dead ends: 1120 [2023-11-29 00:25:30,417 INFO L226 Difference]: Without dead ends: 1119 [2023-11-29 00:25:30,418 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:25:30,421 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 369 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:30,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1399 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 00:25:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2023-11-29 00:25:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 964. [2023-11-29 00:25:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 491 states have (on average 2.1894093686354377) internal successors, (1075), 940 states have internal predecessors, (1075), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:25:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1115 transitions. [2023-11-29 00:25:30,493 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1115 transitions. Word has length 2 [2023-11-29 00:25:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:30,493 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1115 transitions. [2023-11-29 00:25:30,494 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:25:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1115 transitions. [2023-11-29 00:25:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:25:30,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:30,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:25:30,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:25:30,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:25:30,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash 65759, now seen corresponding path program 1 times [2023-11-29 00:25:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:25:30,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247360676] [2023-11-29 00:25:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:30,702 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:25:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:25:30,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:30,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:30,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:25:30,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:25:30,954 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:25:30,982 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:25:30,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:25:30,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:25:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247360676] [2023-11-29 00:25:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247360676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:25:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641232529] [2023-11-29 00:25:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:30,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:25:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:25:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:25:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:25:30,986 INFO L87 Difference]: Start difference. First operand 964 states and 1115 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:25:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:36,123 INFO L93 Difference]: Finished difference Result 963 states and 1114 transitions. [2023-11-29 00:25:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:25:36,125 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:25:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:36,129 INFO L225 Difference]: With dead ends: 963 [2023-11-29 00:25:36,129 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 00:25:36,129 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:25:36,130 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 9 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:36,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1643 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 00:25:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 00:25:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2023-11-29 00:25:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 491 states have (on average 2.1873727087576373) internal successors, (1074), 939 states have internal predecessors, (1074), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:25:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1114 transitions. [2023-11-29 00:25:36,156 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1114 transitions. Word has length 2 [2023-11-29 00:25:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:36,156 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1114 transitions. [2023-11-29 00:25:36,156 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:25:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1114 transitions. [2023-11-29 00:25:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 00:25:36,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:36,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 00:25:36,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:36,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:25:36,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:25:36,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:36,358 INFO L85 PathProgramCache]: Analyzing trace with hash 64841542, now seen corresponding path program 1 times [2023-11-29 00:25:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:25:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006689095] [2023-11-29 00:25:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:36,359 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:25:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:25:36,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:36,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:36,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:25:36,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:25:36,581 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:25:36,663 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:25:36,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:25:36,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:25:36,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006689095] [2023-11-29 00:25:36,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006689095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:36,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:25:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785656876] [2023-11-29 00:25:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:36,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:25:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:25:36,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:25:36,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:25:36,665 INFO L87 Difference]: Start difference. First operand 963 states and 1114 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:25:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:43,324 INFO L93 Difference]: Finished difference Result 965 states and 1116 transitions. [2023-11-29 00:25:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:25:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 00:25:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:43,329 INFO L225 Difference]: With dead ends: 965 [2023-11-29 00:25:43,329 INFO L226 Difference]: Without dead ends: 965 [2023-11-29 00:25:43,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:25:43,330 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 9 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:43,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2279 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 00:25:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-11-29 00:25:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2023-11-29 00:25:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 493 states have (on average 2.182555780933063) internal successors, (1076), 941 states have internal predecessors, (1076), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:25:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1116 transitions. [2023-11-29 00:25:43,351 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1116 transitions. Word has length 4 [2023-11-29 00:25:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:43,351 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1116 transitions. [2023-11-29 00:25:43,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:25:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1116 transitions. [2023-11-29 00:25:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:25:43,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:43,353 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-29 00:25:43,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:25:43,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:25:43,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:25:43,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2110227886, now seen corresponding path program 1 times [2023-11-29 00:25:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:25:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343334051] [2023-11-29 00:25:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:43,557 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:25:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:25:43,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:43,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:25:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:43,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:25:43,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:25:43,748 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:25:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:25:43,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:25:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:25:44,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:25:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343334051] [2023-11-29 00:25:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343334051] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:25:44,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:25:44,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-29 00:25:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372042204] [2023-11-29 00:25:44,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:25:44,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:25:44,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:25:44,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:25:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:25:44,519 INFO L87 Difference]: Start difference. First operand 965 states and 1116 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:26:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:07,772 INFO L93 Difference]: Finished difference Result 967 states and 1118 transitions. [2023-11-29 00:26:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:26:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 6 [2023-11-29 00:26:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:07,778 INFO L225 Difference]: With dead ends: 967 [2023-11-29 00:26:07,778 INFO L226 Difference]: Without dead ends: 967 [2023-11-29 00:26:07,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:07,779 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 19 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:07,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2915 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 23.1s Time] [2023-11-29 00:26:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2023-11-29 00:26:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2023-11-29 00:26:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 496 states have (on average 2.1733870967741935) internal successors, (1078), 943 states have internal predecessors, (1078), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:26:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1118 transitions. [2023-11-29 00:26:07,808 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1118 transitions. Word has length 6 [2023-11-29 00:26:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:07,808 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1118 transitions. [2023-11-29 00:26:07,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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:26:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1118 transitions. [2023-11-29 00:26:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:26:07,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:07,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-29 00:26:07,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:08,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:08,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:08,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1336459043, now seen corresponding path program 1 times [2023-11-29 00:26:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490192836] [2023-11-29 00:26:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:08,018 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:26:08,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:08,019 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:08,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:26:08,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:26:08,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:26:08,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:08,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490192836] [2023-11-29 00:26:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490192836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:08,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:26:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 00:26:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106974834] [2023-11-29 00:26:08,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:08,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:26:08,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:26:08,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:08,524 INFO L87 Difference]: Start difference. First operand 967 states and 1118 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:26:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:11,911 INFO L93 Difference]: Finished difference Result 977 states and 1128 transitions. [2023-11-29 00:26:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:26:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 00:26:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:11,917 INFO L225 Difference]: With dead ends: 977 [2023-11-29 00:26:11,917 INFO L226 Difference]: Without dead ends: 977 [2023-11-29 00:26:11,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:26:11,917 INFO L413 NwaCegarLoop]: 1009 mSDtfsCounter, 5 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6044 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:11,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6044 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:26:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2023-11-29 00:26:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2023-11-29 00:26:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 506 states have (on average 2.150197628458498) internal successors, (1088), 953 states have internal predecessors, (1088), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 00:26:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1128 transitions. [2023-11-29 00:26:11,938 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1128 transitions. Word has length 11 [2023-11-29 00:26:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:11,938 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1128 transitions. [2023-11-29 00:26:11,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:26:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1128 transitions. [2023-11-29 00:26:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 00:26:11,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:11,939 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 00:26:11,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:26:12,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:12,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:12,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1882031137, now seen corresponding path program 2 times [2023-11-29 00:26:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959122467] [2023-11-29 00:26:12,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:26:12,141 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:26:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:12,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:12,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:12,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:26:12,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:12,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:26:12,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:12,418 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:26:12,418 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:26:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 00:26:12,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:12,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959122467] [2023-11-29 00:26:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959122467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:12,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:12,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:26:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605240214] [2023-11-29 00:26:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:12,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:26:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:26:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:26:12,796 INFO L87 Difference]: Start difference. First operand 977 states and 1128 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:26:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:20,546 INFO L93 Difference]: Finished difference Result 1333 states and 1543 transitions. [2023-11-29 00:26:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:26:20,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 21 [2023-11-29 00:26:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:20,552 INFO L225 Difference]: With dead ends: 1333 [2023-11-29 00:26:20,552 INFO L226 Difference]: Without dead ends: 1333 [2023-11-29 00:26:20,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:26:20,553 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 590 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:20,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1379 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 00:26:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-29 00:26:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1159. [2023-11-29 00:26:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 677 states have (on average 2.1624815361890692) internal successors, (1464), 1123 states have internal predecessors, (1464), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:26:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1519 transitions. [2023-11-29 00:26:20,585 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1519 transitions. Word has length 21 [2023-11-29 00:26:20,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:20,586 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1519 transitions. [2023-11-29 00:26:20,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:26:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1519 transitions. [2023-11-29 00:26:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 00:26:20,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:20,587 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 00:26:20,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:20,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:20,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:20,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1882031138, now seen corresponding path program 1 times [2023-11-29 00:26:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721581259] [2023-11-29 00:26:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:20,788 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:26:20,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:20,789 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:20,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:26:21,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:26:21,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:26:21,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:21,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721581259] [2023-11-29 00:26:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721581259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:21,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:26:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 00:26:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544041993] [2023-11-29 00:26:21,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:21,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 00:26:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:21,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 00:26:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:26:21,669 INFO L87 Difference]: Start difference. First operand 1159 states and 1519 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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:26:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:28,390 INFO L93 Difference]: Finished difference Result 1163 states and 1523 transitions. [2023-11-29 00:26:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:26:28,392 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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 21 [2023-11-29 00:26:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:28,397 INFO L225 Difference]: With dead ends: 1163 [2023-11-29 00:26:28,398 INFO L226 Difference]: Without dead ends: 1163 [2023-11-29 00:26:28,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:26:28,398 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 2 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13080 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:28,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13080 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 00:26:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2023-11-29 00:26:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2023-11-29 00:26:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 681 states have (on average 2.1556534508076357) internal successors, (1468), 1127 states have internal predecessors, (1468), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:26:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1523 transitions. [2023-11-29 00:26:28,418 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1523 transitions. Word has length 21 [2023-11-29 00:26:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:28,418 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1523 transitions. [2023-11-29 00:26:28,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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:26:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1523 transitions. [2023-11-29 00:26:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:26:28,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:28,419 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-29 00:26:28,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:28,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:28,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:28,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash -233470966, now seen corresponding path program 2 times [2023-11-29 00:26:28,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:28,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423547709] [2023-11-29 00:26:28,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:26:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:26:28,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:28,621 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:28,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:28,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:26:28,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:28,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:26:28,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:28,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:28,879 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:26:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:26:29,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:29,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423547709] [2023-11-29 00:26:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423547709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:29,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:29,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:26:29,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640136110] [2023-11-29 00:26:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:29,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:26:29,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:26:29,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:26:29,256 INFO L87 Difference]: Start difference. First operand 1163 states and 1523 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:26:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:34,498 INFO L93 Difference]: Finished difference Result 1166 states and 1525 transitions. [2023-11-29 00:26:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:26:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 25 [2023-11-29 00:26:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:34,505 INFO L225 Difference]: With dead ends: 1166 [2023-11-29 00:26:34,505 INFO L226 Difference]: Without dead ends: 1166 [2023-11-29 00:26:34,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:26:34,506 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 6 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:34,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1649 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 00:26:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-29 00:26:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2023-11-29 00:26:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 684 states have (on average 2.1491228070175437) internal successors, (1470), 1129 states have internal predecessors, (1470), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:26:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1525 transitions. [2023-11-29 00:26:34,533 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1525 transitions. Word has length 25 [2023-11-29 00:26:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:34,533 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1525 transitions. [2023-11-29 00:26:34,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:26:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1525 transitions. [2023-11-29 00:26:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:26:34,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:34,535 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:34,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:34,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:34,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1601639987, now seen corresponding path program 1 times [2023-11-29 00:26:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346006651] [2023-11-29 00:26:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:34,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:26:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:34,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:34,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:26:35,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:35,178 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:26:35,178 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 00:26:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:26:35,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:35,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346006651] [2023-11-29 00:26:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346006651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:26:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346231644] [2023-11-29 00:26:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:35,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:26:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:35,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:26:35,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:26:35,219 INFO L87 Difference]: Start difference. First operand 1166 states and 1525 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:26:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:42,742 INFO L93 Difference]: Finished difference Result 1239 states and 1526 transitions. [2023-11-29 00:26:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:26:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 32 [2023-11-29 00:26:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:42,749 INFO L225 Difference]: With dead ends: 1239 [2023-11-29 00:26:42,749 INFO L226 Difference]: Without dead ends: 1239 [2023-11-29 00:26:42,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:26:42,750 INFO L413 NwaCegarLoop]: 872 mSDtfsCounter, 354 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:42,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1400 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-29 00:26:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-11-29 00:26:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1161. [2023-11-29 00:26:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 684 states have (on average 2.141812865497076) internal successors, (1465), 1124 states have internal predecessors, (1465), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:26:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1520 transitions. [2023-11-29 00:26:42,777 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1520 transitions. Word has length 32 [2023-11-29 00:26:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:42,777 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1520 transitions. [2023-11-29 00:26:42,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:26:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1520 transitions. [2023-11-29 00:26:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:26:42,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:42,778 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:42,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:42,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:42,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:42,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1601639988, now seen corresponding path program 1 times [2023-11-29 00:26:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246168606] [2023-11-29 00:26:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:42,980 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:26:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:42,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:42,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:43,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:26:43,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:43,549 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:26:43,549 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 00:26:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:26:43,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:43,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246168606] [2023-11-29 00:26:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246168606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:26:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159026776] [2023-11-29 00:26:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:43,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:26:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:26:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:26:43,664 INFO L87 Difference]: Start difference. First operand 1161 states and 1520 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:26:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:56,064 INFO L93 Difference]: Finished difference Result 1162 states and 1522 transitions. [2023-11-29 00:26:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:26:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 32 [2023-11-29 00:26:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:56,071 INFO L225 Difference]: With dead ends: 1162 [2023-11-29 00:26:56,071 INFO L226 Difference]: Without dead ends: 1162 [2023-11-29 00:26:56,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:56,072 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 834 mSDsluCounter, 2821 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:56,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3812 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-11-29 00:26:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-11-29 00:26:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2023-11-29 00:26:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 684 states have (on average 2.1403508771929824) internal successors, (1464), 1123 states have internal predecessors, (1464), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:26:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1519 transitions. [2023-11-29 00:26:56,097 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1519 transitions. Word has length 32 [2023-11-29 00:26:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:56,097 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1519 transitions. [2023-11-29 00:26:56,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:26:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1519 transitions. [2023-11-29 00:26:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 00:26:56,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:56,099 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:56,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:56,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:26:56,304 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:26:56,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1579295166, now seen corresponding path program 1 times [2023-11-29 00:26:56,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:26:56,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492908899] [2023-11-29 00:26:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:56,305 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:26:56,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:26:56,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:56,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:26:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:56,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:26:56,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:56,919 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:26:56,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 00:26:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:26:57,293 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 00:26:57,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-11-29 00:26:57,328 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:26:57,328 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:26:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:26:57,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:26:57,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:26:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492908899] [2023-11-29 00:26:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492908899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:26:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225118703] [2023-11-29 00:26:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:57,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:26:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:26:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:26:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:26:57,483 INFO L87 Difference]: Start difference. First operand 1160 states and 1519 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:27:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:09,070 INFO L93 Difference]: Finished difference Result 1178 states and 1539 transitions. [2023-11-29 00:27:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:09,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 34 [2023-11-29 00:27:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:09,077 INFO L225 Difference]: With dead ends: 1178 [2023-11-29 00:27:09,077 INFO L226 Difference]: Without dead ends: 1178 [2023-11-29 00:27:09,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:27:09,078 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 899 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:09,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 3797 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-29 00:27:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2023-11-29 00:27:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1169. [2023-11-29 00:27:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 693 states have (on average 2.1356421356421356) internal successors, (1480), 1132 states have internal predecessors, (1480), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:27:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1535 transitions. [2023-11-29 00:27:09,106 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1535 transitions. Word has length 34 [2023-11-29 00:27:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:09,107 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1535 transitions. [2023-11-29 00:27:09,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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:27:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1535 transitions. [2023-11-29 00:27:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:27:09,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:09,108 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:09,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:09,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:09,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:27:09,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1580753060, now seen corresponding path program 1 times [2023-11-29 00:27:09,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:27:09,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959408811] [2023-11-29 00:27:09,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:09,310 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:27:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:27:09,311 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:09,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:09,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:27:09,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:09,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:27:09,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:27:09,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 00:27:09,907 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:27:09,908 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:27:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:27:09,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:09,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:27:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959408811] [2023-11-29 00:27:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959408811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:27:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68108437] [2023-11-29 00:27:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:09,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:27:09,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:27:09,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:27:09,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:27:09,945 INFO L87 Difference]: Start difference. First operand 1169 states and 1535 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:27:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:13,106 INFO L93 Difference]: Finished difference Result 1246 states and 1539 transitions. [2023-11-29 00:27:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:27:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 36 [2023-11-29 00:27:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:13,112 INFO L225 Difference]: With dead ends: 1246 [2023-11-29 00:27:13,112 INFO L226 Difference]: Without dead ends: 1246 [2023-11-29 00:27:13,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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:27:13,113 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 354 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:13,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1397 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:27:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2023-11-29 00:27:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1168. [2023-11-29 00:27:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 693 states have (on average 2.132756132756133) internal successors, (1478), 1131 states have internal predecessors, (1478), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:27:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1533 transitions. [2023-11-29 00:27:13,137 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1533 transitions. Word has length 36 [2023-11-29 00:27:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:13,137 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1533 transitions. [2023-11-29 00:27:13,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:27:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1533 transitions. [2023-11-29 00:27:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:27:13,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:13,138 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:13,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-29 00:27:13,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:13,348 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:27:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1580753061, now seen corresponding path program 1 times [2023-11-29 00:27:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:27:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680026022] [2023-11-29 00:27:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:13,349 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:27:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:27:13,350 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:13,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:13,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:27:13,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:13,987 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:27:13,998 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 11 treesize of output 10 [2023-11-29 00:27:14,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-29 00:27:14,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:27:14,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:27:14,308 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 19 treesize of output 14 [2023-11-29 00:27:14,347 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:27:14,348 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:27:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:27:14,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:14,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:27:14,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680026022] [2023-11-29 00:27:14,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680026022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:14,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237630283] [2023-11-29 00:27:14,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:27:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:27:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:27:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:14,516 INFO L87 Difference]: Start difference. First operand 1168 states and 1533 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:27:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:40,569 INFO L93 Difference]: Finished difference Result 1251 states and 1539 transitions. [2023-11-29 00:27:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 36 [2023-11-29 00:27:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:40,575 INFO L225 Difference]: With dead ends: 1251 [2023-11-29 00:27:40,575 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 00:27:40,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:27:40,576 INFO L413 NwaCegarLoop]: 788 mSDtfsCounter, 1409 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:40,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 3579 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 25.8s Time] [2023-11-29 00:27:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 00:27:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1168. [2023-11-29 00:27:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 693 states have (on average 2.1313131313131315) internal successors, (1477), 1131 states have internal predecessors, (1477), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:27:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1532 transitions. [2023-11-29 00:27:40,591 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1532 transitions. Word has length 36 [2023-11-29 00:27:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:40,592 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1532 transitions. [2023-11-29 00:27:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:27:40,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1532 transitions. [2023-11-29 00:27:40,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 00:27:40,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:40,593 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:40,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:40,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:40,793 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:27:40,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:40,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1313181722, now seen corresponding path program 1 times [2023-11-29 00:27:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:27:40,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366297621] [2023-11-29 00:27:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:40,795 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:27:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:27:40,796 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:40,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:41,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:27:41,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:41,372 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:27:41,421 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 21 treesize of output 1 [2023-11-29 00:27:41,584 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 00:27:41,584 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 00:27:41,673 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:27:41,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 14 [2023-11-29 00:27:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:27:41,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:41,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:27:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366297621] [2023-11-29 00:27:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366297621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146092335] [2023-11-29 00:27:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:27:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:27:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:27:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:41,711 INFO L87 Difference]: Start difference. First operand 1168 states and 1532 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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:27:54,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:27:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:58,613 INFO L93 Difference]: Finished difference Result 1165 states and 1528 transitions. [2023-11-29 00:27:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 38 [2023-11-29 00:27:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:58,618 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 00:27:58,618 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 00:27:58,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:58,619 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 829 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:58,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 3328 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1897 Invalid, 1 Unknown, 0 Unchecked, 16.8s Time] [2023-11-29 00:27:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 00:27:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2023-11-29 00:27:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 693 states have (on average 2.1255411255411256) internal successors, (1473), 1128 states have internal predecessors, (1473), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:27:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1528 transitions. [2023-11-29 00:27:58,633 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1528 transitions. Word has length 38 [2023-11-29 00:27:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:58,633 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1528 transitions. [2023-11-29 00:27:58,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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:27:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1528 transitions. [2023-11-29 00:27:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 00:27:58,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:58,634 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:58,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:58,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:58,835 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:27:58,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1313181721, now seen corresponding path program 1 times [2023-11-29 00:27:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:27:58,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527309150] [2023-11-29 00:27:58,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:58,836 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:27:58,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:27:58,837 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:58,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:59,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:27:59,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:59,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:27:59,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:27:59,737 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 25 treesize of output 1 [2023-11-29 00:27:59,758 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 16 treesize of output 12 [2023-11-29 00:27:59,854 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 23 treesize of output 18 [2023-11-29 00:27:59,875 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 21 treesize of output 16 [2023-11-29 00:27:59,940 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 9 [2023-11-29 00:27:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:27:59,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:59,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:27:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527309150] [2023-11-29 00:27:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527309150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:27:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905386376] [2023-11-29 00:27:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:59,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:27:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:59,984 INFO L87 Difference]: Start difference. First operand 1165 states and 1528 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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:28:11,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:28:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:14,323 INFO L93 Difference]: Finished difference Result 1164 states and 1526 transitions. [2023-11-29 00:28:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:28:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 38 [2023-11-29 00:28:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:14,329 INFO L225 Difference]: With dead ends: 1164 [2023-11-29 00:28:14,329 INFO L226 Difference]: Without dead ends: 1164 [2023-11-29 00:28:14,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:28:14,330 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 829 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2914 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:14,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2914 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1475 Invalid, 1 Unknown, 0 Unchecked, 14.2s Time] [2023-11-29 00:28:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2023-11-29 00:28:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1164. [2023-11-29 00:28:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 693 states have (on average 2.1226551226551225) internal successors, (1471), 1127 states have internal predecessors, (1471), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:28:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1526 transitions. [2023-11-29 00:28:14,343 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1526 transitions. Word has length 38 [2023-11-29 00:28:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:14,343 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 1526 transitions. [2023-11-29 00:28:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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:28:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1526 transitions. [2023-11-29 00:28:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 00:28:14,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:28:14,344 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 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:28:14,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 00:28:14,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:14,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:28:14,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1908366319, now seen corresponding path program 1 times [2023-11-29 00:28:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:28:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542583041] [2023-11-29 00:28:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:14,546 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:28:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:28:14,547 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:14,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:15,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 00:28:15,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:15,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:28:15,244 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:28:15,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:28:15,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:28:15,443 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 38 treesize of output 31 [2023-11-29 00:28:15,646 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:28:15,646 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 56 treesize of output 55 [2023-11-29 00:28:15,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-29 00:28:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:28:15,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:28:15,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:28:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542583041] [2023-11-29 00:28:15,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542583041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:15,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:28:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052437374] [2023-11-29 00:28:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:15,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:28:15,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:28:15,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:28:15,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:28:15,824 INFO L87 Difference]: Start difference. First operand 1164 states and 1526 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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:28:30,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:28:34,485 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 [] [2023-11-29 00:28:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:38,946 INFO L93 Difference]: Finished difference Result 1251 states and 1544 transitions. [2023-11-29 00:28:38,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:28:38,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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 41 [2023-11-29 00:28:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:38,952 INFO L225 Difference]: With dead ends: 1251 [2023-11-29 00:28:38,952 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 00:28:38,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:28:38,952 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1019 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:38,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 3189 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2011 Invalid, 2 Unknown, 0 Unchecked, 22.9s Time] [2023-11-29 00:28:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 00:28:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1170. [2023-11-29 00:28:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 699 states have (on average 2.1201716738197427) internal successors, (1482), 1133 states have internal predecessors, (1482), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:28:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1537 transitions. [2023-11-29 00:28:38,966 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1537 transitions. Word has length 41 [2023-11-29 00:28:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:38,966 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1537 transitions. [2023-11-29 00:28:38,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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:28:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1537 transitions. [2023-11-29 00:28:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 00:28:38,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:28:38,967 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 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:28:38,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:39,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:39,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:28:39,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1908366320, now seen corresponding path program 1 times [2023-11-29 00:28:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:28:39,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743699533] [2023-11-29 00:28:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:39,168 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:28:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:28:39,169 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:39,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:40,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:28:40,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:28:40,156 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:28:40,200 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:28:40,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:28:40,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:28:40,313 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 16 treesize of output 12 [2023-11-29 00:28:40,454 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 36 treesize of output 29 [2023-11-29 00:28:40,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-29 00:28:40,729 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:28:40,729 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 80 treesize of output 75 [2023-11-29 00:28:40,743 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 39 treesize of output 16 [2023-11-29 00:28:40,915 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 40 treesize of output 13 [2023-11-29 00:28:40,924 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 12 treesize of output 3 [2023-11-29 00:28:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:28:40,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:28:40,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:28:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743699533] [2023-11-29 00:28:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743699533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:28:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946057611] [2023-11-29 00:28:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:28:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:28:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:28:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:28:40,994 INFO L87 Difference]: Start difference. First operand 1170 states and 1537 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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:29:02,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:29:06,768 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 [] [2023-11-29 00:29:10,775 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 [] [2023-11-29 00:29:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,701 INFO L93 Difference]: Finished difference Result 1249 states and 1539 transitions. [2023-11-29 00:29:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:29:17,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 41 [2023-11-29 00:29:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,707 INFO L225 Difference]: With dead ends: 1249 [2023-11-29 00:29:17,707 INFO L226 Difference]: Without dead ends: 1249 [2023-11-29 00:29:17,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:29:17,707 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1017 mSDsluCounter, 3672 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:17,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 4528 Invalid, 3822 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 3810 Invalid, 3 Unknown, 0 Unchecked, 36.2s Time] [2023-11-29 00:29:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-11-29 00:29:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1170. [2023-11-29 00:29:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 699 states have (on average 2.1144492131616595) internal successors, (1478), 1133 states have internal predecessors, (1478), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:29:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1533 transitions. [2023-11-29 00:29:17,728 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1533 transitions. Word has length 41 [2023-11-29 00:29:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,728 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1533 transitions. [2023-11-29 00:29:17,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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:29:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1533 transitions. [2023-11-29 00:29:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:29:17,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,729 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:17,929 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:29:17,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -293438576, now seen corresponding path program 1 times [2023-11-29 00:29:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:29:17,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406912346] [2023-11-29 00:29:17,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:29:17,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:29:17,931 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:17,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:29:18,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:29:18,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:29:18,960 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:29:18,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:29:19,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:29:19,180 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 38 treesize of output 31 [2023-11-29 00:29:19,415 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:29:19,416 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 56 treesize of output 55 [2023-11-29 00:29:19,617 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:29:19,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-29 00:29:19,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-29 00:29:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 00:29:19,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:29:19,959 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:29:19,989 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:29:20,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:29:20,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:29:20,104 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1345))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1346)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:29:20,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:20,146 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-11-29 00:29:20,154 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 1801 treesize of output 1387 [2023-11-29 00:29:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 169 treesize of output 155 [2023-11-29 00:29:20,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 155 treesize of output 113 [2023-11-29 00:29:20,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 45 [2023-11-29 00:29:21,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:21,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 278 [2023-11-29 00:29:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-11-29 00:29:24,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:29:24,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406912346] [2023-11-29 00:29:24,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406912346] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:29:24,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:29:24,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-29 00:29:24,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229642509] [2023-11-29 00:29:24,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:29:24,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:29:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:29:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:29:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2023-11-29 00:29:24,248 INFO L87 Difference]: Start difference. First operand 1170 states and 1533 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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:29:46,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:29:50,886 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 [] [2023-11-29 00:29:54,890 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 [] [2023-11-29 00:29:58,896 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 [] [2023-11-29 00:30:02,905 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 [] [2023-11-29 00:30:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:12,015 INFO L93 Difference]: Finished difference Result 1247 states and 1537 transitions. [2023-11-29 00:30:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:30:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 44 [2023-11-29 00:30:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:12,020 INFO L225 Difference]: With dead ends: 1247 [2023-11-29 00:30:12,020 INFO L226 Difference]: Without dead ends: 1247 [2023-11-29 00:30:12,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=181, Unknown=5, NotChecked=160, Total=420 [2023-11-29 00:30:12,021 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1334 mSDsluCounter, 5088 mSDsCounter, 0 mSdLazyCounter, 3664 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 5944 SdHoareTripleChecker+Invalid, 9352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3664 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 5668 IncrementalHoareTripleChecker+Unchecked, 47.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:12,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 5944 Invalid, 9352 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 3664 Invalid, 5 Unknown, 5668 Unchecked, 47.2s Time] [2023-11-29 00:30:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-11-29 00:30:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1169. [2023-11-29 00:30:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 699 states have (on average 2.111587982832618) internal successors, (1476), 1132 states have internal predecessors, (1476), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:30:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1531 transitions. [2023-11-29 00:30:12,035 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1531 transitions. Word has length 44 [2023-11-29 00:30:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:12,035 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1531 transitions. [2023-11-29 00:30:12,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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:30:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1531 transitions. [2023-11-29 00:30:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:30:12,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:12,036 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:12,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:12,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:30:12,237 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:30:12,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -293438575, now seen corresponding path program 1 times [2023-11-29 00:30:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:30:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754655749] [2023-11-29 00:30:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:12,238 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:30:12,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:30:12,239 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:12,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:30:13,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 00:30:13,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:30:13,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:30:13,205 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:30:13,245 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:30:13,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:30:13,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:30:13,353 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 16 treesize of output 12 [2023-11-29 00:30:13,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 00:30:13,493 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 21 treesize of output 16 [2023-11-29 00:30:13,750 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:30:13,751 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 80 treesize of output 75 [2023-11-29 00:30:13,765 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 39 treesize of output 16 [2023-11-29 00:30:14,146 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:30:14,147 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 80 treesize of output 75 [2023-11-29 00:30:14,178 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 39 treesize of output 16 [2023-11-29 00:30:14,361 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 40 treesize of output 13 [2023-11-29 00:30:14,369 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 12 treesize of output 3 [2023-11-29 00:30:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-29 00:30:14,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:30:15,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd (_ bv1 64) .cse2 .cse1)))))) is different from false [2023-11-29 00:30:15,373 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd (_ bv1 64) .cse0 .cse3))))))) is different from false [2023-11-29 00:30:15,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1476))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1475) .cse3 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 00:30:15,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1476))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1475) .cse1 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-11-29 00:30:16,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1473 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1474 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1474))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1476))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1473) .cse1 v_ArrVal_1475) .cse2 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1473 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1474 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1474))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1473) .cse7 v_ArrVal_1475) (select (select (store .cse8 .cse7 v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1478))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd .cse0 (_ bv1 64) .cse6)))))) is different from false [2023-11-29 00:30:16,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:30:16,306 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-11-29 00:30:16,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:30:16,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-29 00:30:16,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1481 treesize of output 1238 [2023-11-29 00:30:16,413 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 3512 treesize of output 3287 [2023-11-29 00:30:16,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 987 treesize of output 875 [2023-11-29 00:30:16,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 875 treesize of output 819 [2023-11-29 00:30:16,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 819 treesize of output 763 [2023-11-29 00:30:16,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 763 treesize of output 679 [2023-11-29 00:30:16,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 679 treesize of output 511 [2023-11-29 00:30:16,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:30:16,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-29 00:30:16,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:30:16,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-29 00:30:16,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:30:16,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1227 treesize of output 768 [2023-11-29 00:30:16,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:30:16,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:30:16,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 00:30:17,321 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 00:30:17,322 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 15 treesize of output 14 [2023-11-29 00:30:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-11-29 00:30:17,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:30:17,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754655749] [2023-11-29 00:30:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754655749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:30:17,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:30:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-11-29 00:30:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835461679] [2023-11-29 00:30:17,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:30:17,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 00:30:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:30:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 00:30:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2023-11-29 00:30:17,328 INFO L87 Difference]: Start difference. First operand 1169 states and 1531 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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:31:01,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:05,759 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 [] [2023-11-29 00:31:09,764 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 [] [2023-11-29 00:31:13,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:17,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:31:21,812 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 [] [2023-11-29 00:31:25,823 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 [] [2023-11-29 00:31:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:31:41,105 INFO L93 Difference]: Finished difference Result 1255 states and 1544 transitions. [2023-11-29 00:31:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:31:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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 44 [2023-11-29 00:31:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:31:41,112 INFO L225 Difference]: With dead ends: 1255 [2023-11-29 00:31:41,112 INFO L226 Difference]: Without dead ends: 1255 [2023-11-29 00:31:41,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=126, Invalid=441, Unknown=5, NotChecked=240, Total=812 [2023-11-29 00:31:41,112 INFO L413 NwaCegarLoop]: 855 mSDtfsCounter, 1024 mSDsluCounter, 8147 mSDsCounter, 0 mSdLazyCounter, 6833 mSolverCounterSat, 10 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 9002 SdHoareTripleChecker+Invalid, 12518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6833 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 5668 IncrementalHoareTripleChecker+Unchecked, 81.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:31:41,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 9002 Invalid, 12518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6833 Invalid, 7 Unknown, 5668 Unchecked, 81.7s Time] [2023-11-29 00:31:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2023-11-29 00:31:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1175. [2023-11-29 00:31:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 705 states have (on average 2.10354609929078) internal successors, (1483), 1138 states have internal predecessors, (1483), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:31:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1538 transitions. [2023-11-29 00:31:41,126 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1538 transitions. Word has length 44 [2023-11-29 00:31:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:31:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1538 transitions. [2023-11-29 00:31:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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:31:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1538 transitions. [2023-11-29 00:31:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:31:41,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:31:41,127 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:31:41,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 00:31:41,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:31:41,328 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:31:41,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:31:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1522521008, now seen corresponding path program 2 times [2023-11-29 00:31:41,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:31:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451536667] [2023-11-29 00:31:41,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:31:41,329 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:31:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:31:41,330 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:41,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:42,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:31:42,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:31:42,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 00:31:42,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:31:42,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:31:43,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:31:43,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:31:43,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:31:43,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:31:43,177 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 16 treesize of output 12 [2023-11-29 00:31:43,338 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 36 treesize of output 29 [2023-11-29 00:31:43,345 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 21 treesize of output 16 [2023-11-29 00:31:43,632 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:31:43,633 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 80 treesize of output 75 [2023-11-29 00:31:43,646 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 39 treesize of output 16 [2023-11-29 00:31:44,047 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:31:44,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 00:31:44,077 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 39 treesize of output 16 [2023-11-29 00:31:44,478 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:31:44,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 00:31:44,512 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 39 treesize of output 16 [2023-11-29 00:31:44,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-29 00:31:44,710 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 12 treesize of output 3 [2023-11-29 00:31:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 00:31:44,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:31:45,759 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 00:31:45,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 00:31:46,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1614) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1615) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1615))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1614) .cse3 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 00:31:46,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1614) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1615) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1615))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1614) .cse4 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-29 00:31:46,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1612))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1615))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1613) .cse0 v_ArrVal_1614) .cse1 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1612))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1613) .cse7 v_ArrVal_1614) (select (select (store .cse8 .cse7 v_ArrVal_1615) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1617))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd .cse6 (_ bv1 64) .cse3)))))) is different from false [2023-11-29 00:31:51,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1612))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1615))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1613) .cse1 v_ArrVal_1614) .cse2 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1612))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1613) .cse8 v_ArrVal_1614) (select (select (store .cse9 .cse8 v_ArrVal_1615) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1617))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd .cse7 (_ bv1 64) .cse4))))))) is different from false [2023-11-29 00:31:55,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1611 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1610))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1612))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_1615))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1611) .cse1 v_ArrVal_1613) .cse2 v_ArrVal_1614) .cse3 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1611 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1610))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1612))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1611) .cse9 v_ArrVal_1613) .cse10 v_ArrVal_1614) (select (select (store .cse11 .cse10 v_ArrVal_1615) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1617))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse8) (bvadd (_ bv1 64) .cse0 .cse8)))))) is different from false [2023-11-29 00:31:55,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:31:55,580 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2023-11-29 00:31:55,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:31:55,625 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2023-11-29 00:31:55,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16851 treesize of output 14034 [2023-11-29 00:31:55,728 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 12396 treesize of output 11937 [2023-11-29 00:31:55,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 527 treesize of output 499 [2023-11-29 00:31:55,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 499 treesize of output 415 [2023-11-29 00:31:55,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 415 treesize of output 345 [2023-11-29 00:31:55,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 345 treesize of output 317 [2023-11-29 00:31:55,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 317 treesize of output 289 [2023-11-29 00:31:55,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 168 treesize of output 133 [2023-11-29 00:31:55,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 133 treesize of output 119 [2023-11-29 00:31:56,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:31:56,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-29 00:31:56,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:31:56,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-29 00:31:56,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:31:56,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24323 treesize of output 16376 [2023-11-29 00:31:56,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:31:56,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:31:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 00:31:57,858 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 00:31:57,859 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 15 treesize of output 14 [2023-11-29 00:31:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 9 not checked. [2023-11-29 00:31:57,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:31:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451536667] [2023-11-29 00:31:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451536667] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:31:57,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:31:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2023-11-29 00:31:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956698752] [2023-11-29 00:31:57,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:31:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 00:31:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:31:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 00:31:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=329, Unknown=7, NotChecked=294, Total=702 [2023-11-29 00:31:57,867 INFO L87 Difference]: Start difference. First operand 1175 states and 1538 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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:32:55,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:32:59,991 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 [] [2023-11-29 00:33:03,997 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 [] [2023-11-29 00:33:08,010 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 [] [2023-11-29 00:33:12,021 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 [] [2023-11-29 00:33:16,036 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 [] [2023-11-29 00:33:20,045 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 [] [2023-11-29 00:33:24,056 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 [] [2023-11-29 00:33:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:33:43,970 INFO L93 Difference]: Finished difference Result 1262 states and 1551 transitions. [2023-11-29 00:33:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:33:43,972 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 47 [2023-11-29 00:33:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:33:43,977 INFO L225 Difference]: With dead ends: 1262 [2023-11-29 00:33:43,977 INFO L226 Difference]: Without dead ends: 1262 [2023-11-29 00:33:43,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=164, Invalid=669, Unknown=7, NotChecked=420, Total=1260 [2023-11-29 00:33:43,978 INFO L413 NwaCegarLoop]: 855 mSDtfsCounter, 1398 mSDsluCounter, 9165 mSDsCounter, 0 mSdLazyCounter, 7066 mSolverCounterSat, 13 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 10020 SdHoareTripleChecker+Invalid, 15064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 7066 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 7977 IncrementalHoareTripleChecker+Unchecked, 102.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:33:43,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 10020 Invalid, 15064 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 7066 Invalid, 8 Unknown, 7977 Unchecked, 102.5s Time] [2023-11-29 00:33:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2023-11-29 00:33:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1181. [2023-11-29 00:33:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 711 states have (on average 2.0956399437412094) internal successors, (1490), 1144 states have internal predecessors, (1490), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:33:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1545 transitions. [2023-11-29 00:33:43,992 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1545 transitions. Word has length 47 [2023-11-29 00:33:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:33:43,993 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1545 transitions. [2023-11-29 00:33:43,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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:33:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1545 transitions. [2023-11-29 00:33:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:33:43,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:33:43,994 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:33:44,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:33:44,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:33:44,194 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:33:44,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:33:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1773883185, now seen corresponding path program 3 times [2023-11-29 00:33:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:33:44,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66595319] [2023-11-29 00:33:44,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:33:44,196 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:33:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:33:44,197 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:33:44,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:33:45,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 00:33:45,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:33:45,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 00:33:45,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:33:45,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:33:45,997 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:33:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:33:46,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:33:46,165 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 16 treesize of output 12 [2023-11-29 00:33:46,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:33:46,392 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 36 treesize of output 29 [2023-11-29 00:33:46,404 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 21 treesize of output 16 [2023-11-29 00:33:46,789 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:33:46,790 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 80 treesize of output 75 [2023-11-29 00:33:46,837 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 39 treesize of output 16 [2023-11-29 00:33:47,361 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:33:47,361 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 80 treesize of output 75 [2023-11-29 00:33:47,381 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 39 treesize of output 16 [2023-11-29 00:33:47,943 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:33:47,943 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 80 treesize of output 75 [2023-11-29 00:33:47,963 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 39 treesize of output 16 [2023-11-29 00:33:48,586 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:33:48,587 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 80 treesize of output 75 [2023-11-29 00:33:48,633 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 39 treesize of output 16 [2023-11-29 00:33:48,922 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 40 treesize of output 13 [2023-11-29 00:33:48,938 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 12 treesize of output 3 [2023-11-29 00:33:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:33:49,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:33:50,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd .cse2 (_ bv1 64) .cse1)))))) is different from false [2023-11-29 00:33:50,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd (_ bv1 64) .cse0 .cse3))))))) is different from false [2023-11-29 00:33:50,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1761) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1762))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1761) .cse3 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 00:33:50,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1762))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1761) .cse1 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1761) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-11-29 00:33:51,517 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1759))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1760) .cse2 v_ArrVal_1761) (select (select (store .cse3 .cse2 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1764))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1759))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1762))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1760) .cse5 v_ArrVal_1761) .cse6 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 00:33:55,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1759))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1762))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1760) .cse1 v_ArrVal_1761) .cse2 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1759))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1760) .cse8 v_ArrVal_1761) (select (select (store .cse9 .cse8 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1764))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd (_ bv1 64) .cse7 .cse4))))))) is different from false [2023-11-29 00:33:59,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1757))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1759))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1762))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1758) .cse0 v_ArrVal_1760) .cse1 v_ArrVal_1761) .cse2 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1757))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1759))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1758) .cse9 v_ArrVal_1760) .cse10 v_ArrVal_1761) (select (select (store .cse11 .cse10 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1764))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 .cse4 (_ bv1 64))))))) is different from false [2023-11-29 00:34:04,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1757))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1759))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1758) .cse3 v_ArrVal_1760) .cse4 v_ArrVal_1761) (select (select (store .cse5 .cse4 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1764))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1757))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1759))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1762))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1758) .cse8 v_ArrVal_1760) .cse9 v_ArrVal_1761) .cse10 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-29 00:34:09,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv3 32))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1757))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1759))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1756) .cse2 v_ArrVal_1758) .cse3 v_ArrVal_1760) .cse4 v_ArrVal_1761) (select (select (store .cse5 .cse4 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1764))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1757))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1759))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1762))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1756) .cse9 v_ArrVal_1758) .cse10 v_ArrVal_1760) .cse11 v_ArrVal_1761) .cse12 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) is different from false [2023-11-29 00:34:10,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:34:10,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 888 [2023-11-29 00:34:10,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:34:10,274 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 874 treesize of output 498 [2023-11-29 00:34:10,361 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 1288561 treesize of output 1070770 [2023-11-29 00:34:11,433 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 27315028 treesize of output 26934211 [2023-11-29 00:34:12,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4107 treesize of output 3883 [2023-11-29 00:34:12,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3883 treesize of output 3659 [2023-11-29 00:34:12,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3659 treesize of output 2987 [2023-11-29 00:34:12,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2987 treesize of output 2567 [2023-11-29 00:34:12,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2567 treesize of output 2259 [2023-11-29 00:34:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2259 treesize of output 2203 [2023-11-29 00:34:12,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2203 treesize of output 2091 [2023-11-29 00:34:12,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2091 treesize of output 1867 [2023-11-29 00:34:12,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1867 treesize of output 1811 [2023-11-29 00:34:13,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:34:13,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 899 treesize of output 900 [2023-11-29 00:34:13,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:34:13,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 497 [2023-11-29 00:34:13,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:34:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 837106023 treesize of output 578558622 [2023-11-29 00:35:01,883 WARN L293 SmtUtils]: Spent 48.44s on a formula simplification. DAG size of input: 1828 DAG size of output: 185 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:35:01,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:35:01,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:35:01,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-29 00:35:03,980 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 00:35:03,980 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 15 treesize of output 14 [2023-11-29 00:35:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 18 not checked. [2023-11-29 00:35:03,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:03,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66595319] [2023-11-29 00:35:03,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66595319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:35:03,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:35:03,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 00:35:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104274254] [2023-11-29 00:35:03,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:35:03,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 00:35:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 00:35:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=326, Unknown=9, NotChecked=396, Total=812 [2023-11-29 00:35:03,988 INFO L87 Difference]: Start difference. First operand 1181 states and 1545 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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:37:21,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:37:25,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:37:29,631 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 [] [2023-11-29 00:37:33,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:37:37,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:37:41,686 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 [] [2023-11-29 00:37:45,701 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 [] [2023-11-29 00:37:49,712 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 [] [2023-11-29 00:37:53,724 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 [] [2023-11-29 00:37:57,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:38:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:38:44,859 INFO L93 Difference]: Finished difference Result 1269 states and 1558 transitions. [2023-11-29 00:38:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:38:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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 50 [2023-11-29 00:38:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:38:44,868 INFO L225 Difference]: With dead ends: 1269 [2023-11-29 00:38:44,868 INFO L226 Difference]: Without dead ends: 1269 [2023-11-29 00:38:44,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=196, Invalid=761, Unknown=9, NotChecked=594, Total=1560 [2023-11-29 00:38:44,869 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 1777 mSDsluCounter, 6712 mSDsCounter, 0 mSdLazyCounter, 5618 mSolverCounterSat, 22 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 205.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 7568 SdHoareTripleChecker+Invalid, 15906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5618 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 10256 IncrementalHoareTripleChecker+Unchecked, 211.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:38:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 7568 Invalid, 15906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 5618 Invalid, 10 Unknown, 10256 Unchecked, 211.3s Time] [2023-11-29 00:38:44,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2023-11-29 00:38:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1187. [2023-11-29 00:38:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 717 states have (on average 2.087866108786611) internal successors, (1497), 1150 states have internal predecessors, (1497), 30 states have call successors, (30), 13 states have call predecessors, (30), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 00:38:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1552 transitions. [2023-11-29 00:38:44,886 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1552 transitions. Word has length 50 [2023-11-29 00:38:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:38:44,886 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 1552 transitions. [2023-11-29 00:38:44,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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:38:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1552 transitions. [2023-11-29 00:38:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 00:38:44,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:38:44,887 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:38:44,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 00:38:45,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:38:45,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 449 more)] === [2023-11-29 00:38:45,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:38:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 523973808, now seen corresponding path program 4 times [2023-11-29 00:38:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:38:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215173070] [2023-11-29 00:38:45,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:38:45,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:38:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:38:45,089 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:38:45,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a40debe-d6d1-44bf-98a4-6a307a7d65f4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:47,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:38:47,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:38:47,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 00:38:47,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:47,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 00:38:48,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:38:48,528 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:38:48,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:38:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:38:49,031 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 16 treesize of output 12 [2023-11-29 00:38:49,703 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 36 treesize of output 29 [2023-11-29 00:38:49,845 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 21 treesize of output 16 [2023-11-29 00:38:50,964 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:38:50,964 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 80 treesize of output 75 [2023-11-29 00:38:51,100 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 39 treesize of output 16 [2023-11-29 00:38:52,759 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:38:52,759 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 80 treesize of output 75 [2023-11-29 00:38:52,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 00:38:54,616 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:38:54,616 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 80 treesize of output 75 [2023-11-29 00:38:54,669 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 39 treesize of output 16 [2023-11-29 00:38:56,750 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:38:56,751 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 80 treesize of output 75 [2023-11-29 00:38:56,889 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 39 treesize of output 16 [2023-11-29 00:38:58,899 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 00:38:58,900 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 80 treesize of output 75 [2023-11-29 00:38:59,034 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 39 treesize of output 16 [2023-11-29 00:38:59,995 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 40 treesize of output 13 [2023-11-29 00:39:00,039 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 12 treesize of output 3 [2023-11-29 00:39:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 00:39:00,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:39:02,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 00:39:03,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 00:39:03,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1917) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1916))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1917) .cse3 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 00:39:05,074 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1917) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1916))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1917) .cse4 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-29 00:39:06,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1914))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1915) .cse2 v_ArrVal_1917) (select (select (store .cse3 .cse2 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1919))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1914))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1916))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1915) .cse5 v_ArrVal_1917) .cse6 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 00:39:11,069 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1914))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1916))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1915) .cse1 v_ArrVal_1917) .cse2 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1914))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1915) .cse8 v_ArrVal_1917) (select (select (store .cse9 .cse8 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1919))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd (_ bv1 64) .cse7 .cse4))))))) is different from false [2023-11-29 00:39:15,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1913))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_1914))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_1916))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1912) .cse1 v_ArrVal_1915) .cse2 v_ArrVal_1917) .cse3 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1913))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1914))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem275#1.base| v_ArrVal_1912) .cse9 v_ArrVal_1915) .cse10 v_ArrVal_1917) (select (select (store .cse11 .cse10 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1919))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse8) (bvadd .cse0 .cse8 (_ bv1 64))))))) is different from false [2023-11-29 00:39:20,693 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1913))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1914))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1916))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1912) .cse2 v_ArrVal_1915) .cse3 v_ArrVal_1917) .cse4 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))) (forall ((v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1913))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1914))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1912) .cse10 v_ArrVal_1915) .cse11 v_ArrVal_1917) (select (select (store .cse12 .cse11 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1919))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse9) (bvadd .cse0 (_ bv1 64) .cse9))))))) is different from false [2023-11-29 00:39:26,090 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv4 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1911))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_1913))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1914))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1916))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1910) .cse1 v_ArrVal_1912) .cse2 v_ArrVal_1915) .cse3 v_ArrVal_1917) .cse4 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1911))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_1913))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_1914))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem273#1.base| v_ArrVal_1910) .cse11 v_ArrVal_1912) .cse12 v_ArrVal_1915) .cse13 v_ArrVal_1917) (select (select (store .cse14 .cse13 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1919))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse10) (bvadd .cse0 (_ bv1 64) .cse10)))))) is different from false [2023-11-29 00:39:31,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1911))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_1913))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_1914))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_1916))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1910) .cse2 v_ArrVal_1912) .cse3 v_ArrVal_1915) .cse4 v_ArrVal_1917) .cse5 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))) (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1911))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse16 (store .cse17 .cse12 v_ArrVal_1913))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_1914))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1910) .cse12 v_ArrVal_1912) .cse13 v_ArrVal_1915) .cse14 v_ArrVal_1917) (select (select (store .cse15 .cse14 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1919))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse11) (bvadd .cse0 (_ bv1 64) .cse11))))))) is different from false [2023-11-29 00:39:36,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv4 32))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1918 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1909 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1908 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1909))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_1911))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_1913))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_1914))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_1916))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1908) .cse1 v_ArrVal_1910) .cse2 v_ArrVal_1912) .cse3 v_ArrVal_1915) .cse4 v_ArrVal_1917) .cse5 v_ArrVal_1919) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) (_ bv1 64)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1918) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_1910 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1912 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1911 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1917 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1909 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1908 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1919 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1914 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1913 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1916 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1915 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1909))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_1911))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_1913))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1914))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1908) .cse13 v_ArrVal_1910) .cse14 v_ArrVal_1912) .cse15 v_ArrVal_1915) .cse16 v_ArrVal_1917) (select (select (store .cse17 .cse16 v_ArrVal_1916) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1919))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse12) (bvadd .cse0 .cse12 (_ bv1 64))))))) is different from false [2023-11-29 00:39:37,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:37,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1795 treesize of output 1796 [2023-11-29 00:39:37,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:37,578 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1782 treesize of output 977 [2023-11-29 00:39:39,128 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 35375277400178639 treesize of output 29937350162367446