./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/yes-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/yes-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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 7dd0f599801267a2b289825c69f0bbe5634e253432346cc86e17f834b155b990 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:27,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:27,069 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 04:21:27,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:27,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:27,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:27,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:27,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:27,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:27,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:27,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:27,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:27,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:27,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:27,102 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:27,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:27,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:21:27,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:27,104 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:21:27,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:21:27,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:21:27,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:27,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:21:27,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:21:27,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:27,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:27,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:27,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:27,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:27,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:27,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:27,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:27,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:21:27,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:21:27,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:27,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:27,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:27,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:27,112 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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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 -> 7dd0f599801267a2b289825c69f0bbe5634e253432346cc86e17f834b155b990 [2023-11-29 04:21:27,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:27,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:27,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:27,337 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:27,337 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:27,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/yes-2.i [2023-11-29 04:21:30,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:30,412 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:30,413 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/sv-benchmarks/c/busybox-1.22.0/yes-2.i [2023-11-29 04:21:30,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/2db792a4c/db1d1ac2050d4251bd0fd0d2a4116dea/FLAGba908d55b [2023-11-29 04:21:30,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/2db792a4c/db1d1ac2050d4251bd0fd0d2a4116dea [2023-11-29 04:21:30,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:30,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:30,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:30,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:30,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:30,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f107741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30, skipping insertion in model container [2023-11-29 04:21:30,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:31,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:31,553 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 04:21:31,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e78324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:31, skipping insertion in model container [2023-11-29 04:21:31,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:31,554 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:21:31,556 INFO L158 Benchmark]: Toolchain (without parser) took 1100.50ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 82.5MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:21:31,556 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:31,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1098.10ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 82.5MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 04:21:31,559 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 63.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1098.10ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 82.5MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2342]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/yes-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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 7dd0f599801267a2b289825c69f0bbe5634e253432346cc86e17f834b155b990 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:33,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:33,400 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-29 04:21:33,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:33,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:33,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:33,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:33,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:33,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:33,437 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:33,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:33,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:33,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:33,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:33,440 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:33,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:33,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:21:33,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:33,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:21:33,443 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:21:33,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:21:33,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:33,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:21:33,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:21:33,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:21:33,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:21:33,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:33,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:33,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:33,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:33,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:33,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:33,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:33,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:33,449 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:21:33,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:21:33,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:33,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:33,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:33,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:33,450 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:21:33,451 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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/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 -> 7dd0f599801267a2b289825c69f0bbe5634e253432346cc86e17f834b155b990 [2023-11-29 04:21:33,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:33,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:33,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:33,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:33,758 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:33,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/yes-2.i [2023-11-29 04:21:36,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:36,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:36,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/sv-benchmarks/c/busybox-1.22.0/yes-2.i [2023-11-29 04:21:36,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/7792269d6/b414efa030454ea893b60a708736d9a2/FLAGe2f927b20 [2023-11-29 04:21:36,901 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/data/7792269d6/b414efa030454ea893b60a708736d9a2 [2023-11-29 04:21:36,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:36,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:36,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:36,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:36,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:36,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:36" (1/1) ... [2023-11-29 04:21:36,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40094abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:36, skipping insertion in model container [2023-11-29 04:21:36,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:36" (1/1) ... [2023-11-29 04:21:36,994 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:37,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:37,930 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:21:37,952 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:38,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:38,056 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:21:38,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:38,382 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:21:38,383 WARN L675 CHandler]: The function strerror is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:21:38,383 WARN L675 CHandler]: The function putchar is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:21:38,383 WARN L675 CHandler]: The function fputs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:21:38,390 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:21:38,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38 WrapperNode [2023-11-29 04:21:38,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:38,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:38,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:21:38,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:21:38,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,494 INFO L138 Inliner]: procedures = 610, calls = 150, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 477 [2023-11-29 04:21:38,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:38,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:21:38,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:21:38,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:21:38,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,534 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-29 04:21:38,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:21:38,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:21:38,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:21:38,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:21:38,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (1/1) ... [2023-11-29 04:21:38,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:38,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:21:38,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-29 04:21:38,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-11-29 04:21:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-29 04:21:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-29 04:21:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-29 04:21:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:21:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:21:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-29 04:21:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-29 04:21:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-29 04:21:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-29 04:21:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-29 04:21:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-29 04:21:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:21:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:21:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-29 04:21:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-11-29 04:21:39,030 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:21:39,032 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:21:45,073 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:21:45,139 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:21:45,139 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-29 04:21:45,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:45 BoogieIcfgContainer [2023-11-29 04:21:45,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:21:45,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:21:45,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:21:45,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:21:45,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:21:36" (1/3) ... [2023-11-29 04:21:45,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67778c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:45, skipping insertion in model container [2023-11-29 04:21:45,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:38" (2/3) ... [2023-11-29 04:21:45,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67778c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:45, skipping insertion in model container [2023-11-29 04:21:45,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:45" (3/3) ... [2023-11-29 04:21:45,148 INFO L112 eAbstractionObserver]: Analyzing ICFG yes-2.i [2023-11-29 04:21:45,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:21:45,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 139 error locations. [2023-11-29 04:21:45,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:21:45,237 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;@60a82067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:21:45,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 139 error locations. [2023-11-29 04:21:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 154 states have (on average 2.1948051948051948) internal successors, (338), 293 states have internal predecessors, (338), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:21:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:21:45,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:45,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:21:45,250 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 136 more)] === [2023-11-29 04:21:45,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash 20590, now seen corresponding path program 1 times [2023-11-29 04:21:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795300944] [2023-11-29 04:21:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:45,271 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 04:21:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:45,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:45,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:45,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:21:45,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:45,551 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 04:21:45,566 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 04:21:45,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:45,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795300944] [2023-11-29 04:21:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795300944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:45,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:45,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:21:45,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869020781] [2023-11-29 04:21:45,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:45,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:45,598 INFO L87 Difference]: Start difference. First operand has 303 states, 154 states have (on average 2.1948051948051948) internal successors, (338), 293 states have internal predecessors, (338), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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 04:21:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:46,772 INFO L93 Difference]: Finished difference Result 370 states and 421 transitions. [2023-11-29 04:21:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:46,775 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 04:21:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:46,784 INFO L225 Difference]: With dead ends: 370 [2023-11-29 04:21:46,784 INFO L226 Difference]: Without dead ends: 370 [2023-11-29 04:21:46,785 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 04:21:46,788 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 254 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:46,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 258 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:21:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-29 04:21:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 268. [2023-11-29 04:21:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 138 states have (on average 2.0942028985507246) internal successors, (289), 258 states have internal predecessors, (289), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:21:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 303 transitions. [2023-11-29 04:21:46,832 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 303 transitions. Word has length 2 [2023-11-29 04:21:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:46,832 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 303 transitions. [2023-11-29 04:21:46,832 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 04:21:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 303 transitions. [2023-11-29 04:21:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:21:46,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:46,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:21:46,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:47,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:47,034 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 136 more)] === [2023-11-29 04:21:47,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 20591, now seen corresponding path program 1 times [2023-11-29 04:21:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:47,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281567755] [2023-11-29 04:21:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:47,035 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 04:21:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:47,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:47,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:47,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:21:47,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:47,206 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 04:21:47,225 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 04:21:47,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:47,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:47,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281567755] [2023-11-29 04:21:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281567755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:21:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019039482] [2023-11-29 04:21:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:47,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:47,229 INFO L87 Difference]: Start difference. First operand 268 states and 303 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 04:21:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:48,817 INFO L93 Difference]: Finished difference Result 267 states and 302 transitions. [2023-11-29 04:21:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:48,819 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 04:21:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:48,821 INFO L225 Difference]: With dead ends: 267 [2023-11-29 04:21:48,821 INFO L226 Difference]: Without dead ends: 267 [2023-11-29 04:21:48,821 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 04:21:48,822 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 9 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 427 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 04:21:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-29 04:21:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2023-11-29 04:21:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 138 states have (on average 2.0869565217391304) internal successors, (288), 257 states have internal predecessors, (288), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:21:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2023-11-29 04:21:48,834 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 2 [2023-11-29 04:21:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:48,834 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2023-11-29 04:21:48,835 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 04:21:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2023-11-29 04:21:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 04:21:48,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:48,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 04:21:48,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:49,036 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 136 more)] === [2023-11-29 04:21:49,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 20352604, now seen corresponding path program 1 times [2023-11-29 04:21:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719834331] [2023-11-29 04:21:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:49,038 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 04:21:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:49,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:49,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:49,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:21:49,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:49,203 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 04:21:49,278 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 04:21:49,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:49,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719834331] [2023-11-29 04:21:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719834331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:21:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877758443] [2023-11-29 04:21:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:49,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:21:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:21:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:21:49,281 INFO L87 Difference]: Start difference. First operand 267 states and 302 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 04:21:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:50,872 INFO L93 Difference]: Finished difference Result 269 states and 304 transitions. [2023-11-29 04:21:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:21:50,873 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 04:21:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:50,875 INFO L225 Difference]: With dead ends: 269 [2023-11-29 04:21:50,875 INFO L226 Difference]: Without dead ends: 269 [2023-11-29 04:21:50,875 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 04:21:50,876 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:50,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 427 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 04:21:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-29 04:21:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2023-11-29 04:21:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 140 states have (on average 2.0714285714285716) internal successors, (290), 259 states have internal predecessors, (290), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:21:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2023-11-29 04:21:50,891 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 4 [2023-11-29 04:21:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:50,892 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2023-11-29 04:21:50,892 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 04:21:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2023-11-29 04:21:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:21:50,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:50,893 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-29 04:21:50,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:51,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:51,094 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 136 more)] === [2023-11-29 04:21:51,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1915427071, now seen corresponding path program 1 times [2023-11-29 04:21:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973701174] [2023-11-29 04:21:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:51,095 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 04:21:51,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:51,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:51,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:51,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:21:51,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:51,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:21:51,420 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 04:21:51,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:21:52,045 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 04:21:52,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973701174] [2023-11-29 04:21:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973701174] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:21:52,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:21:52,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-29 04:21:52,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772110542] [2023-11-29 04:21:52,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:21:52,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:21:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:21:52,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:21:52,047 INFO L87 Difference]: Start difference. First operand 269 states and 304 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 04:21:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:59,042 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2023-11-29 04:21:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:21:59,044 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 04:21:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:59,046 INFO L225 Difference]: With dead ends: 271 [2023-11-29 04:21:59,046 INFO L226 Difference]: Without dead ends: 271 [2023-11-29 04:21:59,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:21:59,047 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:59,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 920 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-29 04:21:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-29 04:21:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2023-11-29 04:21:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 143 states have (on average 2.041958041958042) internal successors, (292), 261 states have internal predecessors, (292), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:21:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 306 transitions. [2023-11-29 04:21:59,058 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 306 transitions. Word has length 6 [2023-11-29 04:21:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:59,059 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 306 transitions. [2023-11-29 04:21:59,059 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 04:21:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 306 transitions. [2023-11-29 04:21:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:21:59,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:59,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-29 04:21:59,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:59,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:59,260 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 136 more)] === [2023-11-29 04:21:59,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 98427495, now seen corresponding path program 1 times [2023-11-29 04:21:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115735533] [2023-11-29 04:21:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:21:59,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:59,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:59,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:21:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:59,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:21:59,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:59,499 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 04:21:59,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:21:59,613 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 04:21:59,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115735533] [2023-11-29 04:21:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115735533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:21:59,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:21:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 04:21:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222905416] [2023-11-29 04:21:59,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:21:59,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:21:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:21:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:21:59,616 INFO L87 Difference]: Start difference. First operand 271 states and 306 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 04:22:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:00,798 INFO L93 Difference]: Finished difference Result 281 states and 316 transitions. [2023-11-29 04:22:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:00,800 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 04:22:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:00,802 INFO L225 Difference]: With dead ends: 281 [2023-11-29 04:22:00,802 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 04:22:00,802 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 04:22:00,803 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 5 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:00,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1317 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:22:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 04:22:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-29 04:22:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 153 states have (on average 1.973856209150327) internal successors, (302), 271 states have internal predecessors, (302), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:22:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 316 transitions. [2023-11-29 04:22:00,809 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 316 transitions. Word has length 11 [2023-11-29 04:22:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:00,810 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 316 transitions. [2023-11-29 04:22:00,810 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 04:22:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 316 transitions. [2023-11-29 04:22:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:22:00,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:00,810 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:22:00,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:01,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:01,011 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 136 more)] === [2023-11-29 04:22:01,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 699500942, now seen corresponding path program 2 times [2023-11-29 04:22:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660696755] [2023-11-29 04:22:01,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:22:01,012 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 04:22:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:01,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:01,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:01,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:22:01,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:22:01,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:22:01,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:01,207 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:22:01,208 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 04:22:01,547 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 04:22:01,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:01,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660696755] [2023-11-29 04:22:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660696755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:01,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:22:01,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847894837] [2023-11-29 04:22:01,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:22:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:01,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:22:01,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:22:01,549 INFO L87 Difference]: Start difference. First operand 281 states and 316 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 04:22:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:03,371 INFO L93 Difference]: Finished difference Result 401 states and 451 transitions. [2023-11-29 04:22:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:22:03,373 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 04:22:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:03,375 INFO L225 Difference]: With dead ends: 401 [2023-11-29 04:22:03,375 INFO L226 Difference]: Without dead ends: 401 [2023-11-29 04:22:03,375 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 04:22:03,376 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 278 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:03,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 294 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 04:22:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-11-29 04:22:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 337. [2023-11-29 04:22:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 204 states have (on average 2.014705882352941) internal successors, (411), 321 states have internal predecessors, (411), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 433 transitions. [2023-11-29 04:22:03,384 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 433 transitions. Word has length 21 [2023-11-29 04:22:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:03,384 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 433 transitions. [2023-11-29 04:22:03,384 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 04:22:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 433 transitions. [2023-11-29 04:22:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:22:03,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:03,385 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:22:03,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:03,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:03,591 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 136 more)] === [2023-11-29 04:22:03,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash 699500943, now seen corresponding path program 1 times [2023-11-29 04:22:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551292006] [2023-11-29 04:22:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:03,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:03,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:03,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:03,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:03,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:22:03,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:04,018 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 04:22:04,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:22:04,373 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 04:22:04,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551292006] [2023-11-29 04:22:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551292006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:22:04,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:22:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 04:22:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803571611] [2023-11-29 04:22:04,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:22:04,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:22:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:22:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:22:04,375 INFO L87 Difference]: Start difference. First operand 337 states and 433 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 04:22:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:06,908 INFO L93 Difference]: Finished difference Result 341 states and 437 transitions. [2023-11-29 04:22:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:22:06,910 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 04:22:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:06,912 INFO L225 Difference]: With dead ends: 341 [2023-11-29 04:22:06,912 INFO L226 Difference]: Without dead ends: 341 [2023-11-29 04:22:06,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:22:06,914 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 3 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3408 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3408 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:22:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-29 04:22:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2023-11-29 04:22:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 208 states have (on average 1.9951923076923077) internal successors, (415), 325 states have internal predecessors, (415), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2023-11-29 04:22:06,926 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 21 [2023-11-29 04:22:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:06,927 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2023-11-29 04:22:06,927 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 04:22:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2023-11-29 04:22:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:22:06,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:06,928 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-29 04:22:06,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:07,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:07,128 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 136 more)] === [2023-11-29 04:22:07,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1271479611, now seen corresponding path program 2 times [2023-11-29 04:22:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015612853] [2023-11-29 04:22:07,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:22:07,130 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 04:22:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:07,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:07,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:07,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:22:07,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:22:07,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:22:07,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:22:07,331 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 04:22:07,635 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 04:22:07,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:07,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015612853] [2023-11-29 04:22:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015612853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:22:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983717918] [2023-11-29 04:22:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:22:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:07,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:22:07,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:22:07,637 INFO L87 Difference]: Start difference. First operand 341 states and 437 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 04:22:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:09,104 INFO L93 Difference]: Finished difference Result 344 states and 439 transitions. [2023-11-29 04:22:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:22:09,105 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 04:22:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:09,108 INFO L225 Difference]: With dead ends: 344 [2023-11-29 04:22:09,108 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 04:22:09,108 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 04:22:09,109 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 6 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:09,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 427 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 04:22:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 04:22:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-11-29 04:22:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 211 states have (on average 1.9763033175355451) internal successors, (417), 327 states have internal predecessors, (417), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 439 transitions. [2023-11-29 04:22:09,120 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 439 transitions. Word has length 25 [2023-11-29 04:22:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:09,120 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 439 transitions. [2023-11-29 04:22:09,120 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 04:22:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 439 transitions. [2023-11-29 04:22:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:22:09,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:09,121 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:09,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:09,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:09,322 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 136 more)] === [2023-11-29 04:22:09,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash -172310284, now seen corresponding path program 1 times [2023-11-29 04:22:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115160050] [2023-11-29 04:22:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:09,323 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 04:22:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:09,324 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:09,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:09,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:22:09,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:09,773 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:22:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 04:22:09,804 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 04:22:09,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:09,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:09,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115160050] [2023-11-29 04:22:09,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115160050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:09,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:09,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:22:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176332904] [2023-11-29 04:22:09,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:09,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:22:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:22:09,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:22:09,806 INFO L87 Difference]: Start difference. First operand 344 states and 439 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 04:22:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:11,866 INFO L93 Difference]: Finished difference Result 397 states and 452 transitions. [2023-11-29 04:22:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:22:11,867 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 04:22:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:11,870 INFO L225 Difference]: With dead ends: 397 [2023-11-29 04:22:11,870 INFO L226 Difference]: Without dead ends: 397 [2023-11-29 04:22:11,870 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 04:22:11,871 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 239 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:11,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 297 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:22:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-29 04:22:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 339. [2023-11-29 04:22:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 211 states have (on average 1.95260663507109) internal successors, (412), 322 states have internal predecessors, (412), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 434 transitions. [2023-11-29 04:22:11,879 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 434 transitions. Word has length 32 [2023-11-29 04:22:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:11,879 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 434 transitions. [2023-11-29 04:22:11,879 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 04:22:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 434 transitions. [2023-11-29 04:22:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:22:11,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:11,880 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:11,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:12,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:12,081 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 136 more)] === [2023-11-29 04:22:12,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash -172310283, now seen corresponding path program 1 times [2023-11-29 04:22:12,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:12,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257791945] [2023-11-29 04:22:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:12,082 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 04:22:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:12,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:12,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:12,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:22:12,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:12,625 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:22:12,626 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 04:22:12,743 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 04:22:12,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:12,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257791945] [2023-11-29 04:22:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257791945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:22:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146378256] [2023-11-29 04:22:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:12,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:22:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:22:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:22:12,745 INFO L87 Difference]: Start difference. First operand 339 states and 434 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 04:22:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:16,508 INFO L93 Difference]: Finished difference Result 360 states and 459 transitions. [2023-11-29 04:22:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:22:16,509 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 04:22:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:16,511 INFO L225 Difference]: With dead ends: 360 [2023-11-29 04:22:16,511 INFO L226 Difference]: Without dead ends: 360 [2023-11-29 04:22:16,511 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 04:22:16,511 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 281 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:16,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 896 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:22:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-11-29 04:22:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 338. [2023-11-29 04:22:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 211 states have (on average 1.947867298578199) internal successors, (411), 321 states have internal predecessors, (411), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 433 transitions. [2023-11-29 04:22:16,519 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 433 transitions. Word has length 32 [2023-11-29 04:22:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:16,519 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 433 transitions. [2023-11-29 04:22:16,519 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 04:22:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 433 transitions. [2023-11-29 04:22:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 04:22:16,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:16,520 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:22:16,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:16,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:16,721 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 136 more)] === [2023-11-29 04:22:16,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1914056236, now seen corresponding path program 1 times [2023-11-29 04:22:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134974509] [2023-11-29 04:22:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:16,722 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 04:22:16,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:16,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:16,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:17,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:22:17,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:17,282 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:22:17,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 04:22:17,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:22:17,618 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 04:22:17,619 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 04:22:17,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:22:17,651 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 04:22:17,806 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 04:22:17,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:17,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134974509] [2023-11-29 04:22:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134974509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:22:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84688551] [2023-11-29 04:22:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:17,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:22:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:22:17,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:22:17,809 INFO L87 Difference]: Start difference. First operand 338 states and 433 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 04:22:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:23,804 INFO L93 Difference]: Finished difference Result 376 states and 476 transitions. [2023-11-29 04:22:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:22:23,806 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 04:22:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:23,808 INFO L225 Difference]: With dead ends: 376 [2023-11-29 04:22:23,808 INFO L226 Difference]: Without dead ends: 376 [2023-11-29 04:22:23,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:23,809 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 354 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:23,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1034 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-29 04:22:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-29 04:22:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 347. [2023-11-29 04:22:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 220 states have (on average 1.940909090909091) internal successors, (427), 330 states have internal predecessors, (427), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 449 transitions. [2023-11-29 04:22:23,818 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 449 transitions. Word has length 34 [2023-11-29 04:22:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:23,819 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 449 transitions. [2023-11-29 04:22:23,819 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 04:22:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 449 transitions. [2023-11-29 04:22:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:22:23,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:23,820 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 04:22:23,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:24,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:24,020 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 136 more)] === [2023-11-29 04:22:24,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:24,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1162546236, now seen corresponding path program 1 times [2023-11-29 04:22:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879860483] [2023-11-29 04:22:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:24,022 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 04:22:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:24,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:24,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:24,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:22:24,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:24,497 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 04:22:24,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:22:24,507 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 04:22:24,540 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:22:24,540 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 04:22:24,570 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 04:22:24,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:24,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879860483] [2023-11-29 04:22:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879860483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:22:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932123970] [2023-11-29 04:22:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:22:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:22:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:22:24,573 INFO L87 Difference]: Start difference. First operand 347 states and 449 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 04:22:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:25,716 INFO L93 Difference]: Finished difference Result 404 states and 465 transitions. [2023-11-29 04:22:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:22:25,718 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 04:22:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:25,720 INFO L225 Difference]: With dead ends: 404 [2023-11-29 04:22:25,720 INFO L226 Difference]: Without dead ends: 404 [2023-11-29 04:22:25,720 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 04:22:25,721 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 234 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:25,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 301 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:22:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-11-29 04:22:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2023-11-29 04:22:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 220 states have (on average 1.9318181818181819) internal successors, (425), 329 states have internal predecessors, (425), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 447 transitions. [2023-11-29 04:22:25,731 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 447 transitions. Word has length 36 [2023-11-29 04:22:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:25,732 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 447 transitions. [2023-11-29 04:22:25,732 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 04:22:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 447 transitions. [2023-11-29 04:22:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:22:25,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:25,733 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 04:22:25,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:22:25,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:25,938 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 136 more)] === [2023-11-29 04:22:25,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:25,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1162546237, now seen corresponding path program 1 times [2023-11-29 04:22:25,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:25,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260510473] [2023-11-29 04:22:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:25,940 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 04:22:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:25,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:25,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:26,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:22:26,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:26,537 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 04:22:26,562 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 04:22:26,573 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 04:22:26,591 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 04:22:26,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:22:26,831 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 04:22:26,849 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:22:26,850 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 04:22:27,011 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 04:22:27,011 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:27,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260510473] [2023-11-29 04:22:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260510473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:27,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:22:27,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601349634] [2023-11-29 04:22:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:27,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:22:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:22:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:22:27,012 INFO L87 Difference]: Start difference. First operand 346 states and 447 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 04:22:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:38,560 INFO L93 Difference]: Finished difference Result 409 states and 465 transitions. [2023-11-29 04:22:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:22:38,561 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 04:22:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:38,563 INFO L225 Difference]: With dead ends: 409 [2023-11-29 04:22:38,563 INFO L226 Difference]: Without dead ends: 409 [2023-11-29 04:22:38,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:22:38,564 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 577 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:38,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 748 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-11-29 04:22:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-29 04:22:38,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 346. [2023-11-29 04:22:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 220 states have (on average 1.9272727272727272) internal successors, (424), 329 states have internal predecessors, (424), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 446 transitions. [2023-11-29 04:22:38,572 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 446 transitions. Word has length 36 [2023-11-29 04:22:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:38,572 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 446 transitions. [2023-11-29 04:22:38,572 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 04:22:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 446 transitions. [2023-11-29 04:22:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:22:38,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:38,572 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 04:22:38,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:38,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:38,773 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 136 more)] === [2023-11-29 04:22:38,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 515937383, now seen corresponding path program 1 times [2023-11-29 04:22:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231033401] [2023-11-29 04:22:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:38,774 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 04:22:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:38,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:38,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:39,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:22:39,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:39,357 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 04:22:39,400 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 04:22:39,543 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:22:39,544 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 04:22:39,633 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:22:39,633 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 04:22:39,667 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 04:22:39,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:39,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231033401] [2023-11-29 04:22:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231033401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:22:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106930698] [2023-11-29 04:22:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:39,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:22:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:22:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:22:39,669 INFO L87 Difference]: Start difference. First operand 346 states and 446 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 04:22:46,246 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 [0] [2023-11-29 04:22:50,253 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 04:22:54,262 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 04:22:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:55,171 INFO L93 Difference]: Finished difference Result 345 states and 444 transitions. [2023-11-29 04:22:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:22:55,172 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 04:22:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:55,174 INFO L225 Difference]: With dead ends: 345 [2023-11-29 04:22:55,174 INFO L226 Difference]: Without dead ends: 345 [2023-11-29 04:22:55,174 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 04:22:55,174 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 259 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:55,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 699 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2023-11-29 04:22:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-29 04:22:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2023-11-29 04:22:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 220 states have (on average 1.9181818181818182) internal successors, (422), 328 states have internal predecessors, (422), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:22:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 444 transitions. [2023-11-29 04:22:55,182 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 444 transitions. Word has length 38 [2023-11-29 04:22:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:55,183 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 444 transitions. [2023-11-29 04:22:55,183 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 04:22:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 444 transitions. [2023-11-29 04:22:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:22:55,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:55,184 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 04:22:55,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:55,384 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 136 more)] === [2023-11-29 04:22:55,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 515937384, now seen corresponding path program 1 times [2023-11-29 04:22:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609723460] [2023-11-29 04:22:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:55,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:22:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:55,386 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:55,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:55,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:22:55,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:55,950 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 04:22:55,982 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 04:22:56,026 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 04:22:56,053 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 04:22:56,148 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 04:22:56,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-29 04:22:56,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-29 04:22:56,261 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 04:22:56,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:22:56,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609723460] [2023-11-29 04:22:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609723460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:22:56,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:22:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:22:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346069555] [2023-11-29 04:22:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:22:56,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:22:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:22:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:22:56,264 INFO L87 Difference]: Start difference. First operand 345 states and 444 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 04:23:03,079 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 04:23:07,088 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 04:23:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:23:08,147 INFO L93 Difference]: Finished difference Result 344 states and 442 transitions. [2023-11-29 04:23:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:23:08,149 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 04:23:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:23:08,151 INFO L225 Difference]: With dead ends: 344 [2023-11-29 04:23:08,151 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 04:23:08,151 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 04:23:08,152 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 246 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:23:08,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 872 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 559 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 04:23:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 04:23:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2023-11-29 04:23:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 327 states have internal predecessors, (420), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:23:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 442 transitions. [2023-11-29 04:23:08,159 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 442 transitions. Word has length 38 [2023-11-29 04:23:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:23:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 442 transitions. [2023-11-29 04:23:08,160 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 04:23:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 442 transitions. [2023-11-29 04:23:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:23:08,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:23:08,161 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 04:23:08,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:08,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:23:08,361 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 136 more)] === [2023-11-29 04:23:08,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1381976539, now seen corresponding path program 1 times [2023-11-29 04:23:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:23:08,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672439941] [2023-11-29 04:23:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:08,363 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 04:23:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:23:08,364 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:08,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:08,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:23:08,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:23:08,964 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 04:23:09,051 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:23:09,052 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 04:23:09,145 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 04:23:09,239 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 04:23:09,426 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:23:09,426 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 04:23:09,479 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 04:23:09,591 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 04:23:09,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:23:09,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:23:09,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672439941] [2023-11-29 04:23:09,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672439941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:09,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:09,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:23:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570606254] [2023-11-29 04:23:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:09,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:23:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:23:09,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:23:09,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:23:09,594 INFO L87 Difference]: Start difference. First operand 344 states and 442 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 04:23:17,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:23:19,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:23:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:23:21,485 INFO L93 Difference]: Finished difference Result 411 states and 472 transitions. [2023-11-29 04:23:21,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:23:21,486 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 04:23:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:23:21,488 INFO L225 Difference]: With dead ends: 411 [2023-11-29 04:23:21,488 INFO L226 Difference]: Without dead ends: 411 [2023-11-29 04:23:21,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:23:21,489 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 558 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:23:21,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 930 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 864 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2023-11-29 04:23:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-29 04:23:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 350. [2023-11-29 04:23:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 226 states have (on average 1.907079646017699) internal successors, (431), 333 states have internal predecessors, (431), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:23:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 453 transitions. [2023-11-29 04:23:21,500 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 453 transitions. Word has length 41 [2023-11-29 04:23:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:23:21,500 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 453 transitions. [2023-11-29 04:23:21,500 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 04:23:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 453 transitions. [2023-11-29 04:23:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:23:21,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:23:21,501 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 04:23:21,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:21,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:23:21,702 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 136 more)] === [2023-11-29 04:23:21,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1381976538, now seen corresponding path program 1 times [2023-11-29 04:23:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:23:21,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268069611] [2023-11-29 04:23:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:21,703 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 04:23:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:23:21,704 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:21,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:22,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 04:23:22,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:23:22,359 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 04:23:22,427 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:23:22,427 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 04:23:22,441 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 04:23:22,507 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 04:23:22,528 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 04:23:22,660 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 04:23:22,688 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 04:23:22,888 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:23:22,888 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 04:23:22,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 04:23:23,059 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 04:23:23,072 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 04:23:23,120 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 04:23:23,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:23:23,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:23:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268069611] [2023-11-29 04:23:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268069611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:23:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:23:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:23:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924598830] [2023-11-29 04:23:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:23:23,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:23:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:23:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:23:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:23:23,122 INFO L87 Difference]: Start difference. First operand 350 states and 453 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 04:23:32,089 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 04:23:36,102 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 04:23:40,112 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 04:23:44,118 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 04:23:48,218 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 04:23:52,227 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 04:23:56,234 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 04:24:00,243 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 04:24:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:24:02,754 INFO L93 Difference]: Finished difference Result 409 states and 467 transitions. [2023-11-29 04:24:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:24:02,755 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 04:24:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:24:02,757 INFO L225 Difference]: With dead ends: 409 [2023-11-29 04:24:02,758 INFO L226 Difference]: Without dead ends: 409 [2023-11-29 04:24:02,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:24:02,758 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 370 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:24:02,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 940 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1331 Invalid, 8 Unknown, 0 Unchecked, 39.2s Time] [2023-11-29 04:24:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-29 04:24:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 350. [2023-11-29 04:24:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 226 states have (on average 1.8893805309734513) internal successors, (427), 333 states have internal predecessors, (427), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:24:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 449 transitions. [2023-11-29 04:24:02,766 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 449 transitions. Word has length 41 [2023-11-29 04:24:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:24:02,767 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 449 transitions. [2023-11-29 04:24:02,767 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 04:24:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 449 transitions. [2023-11-29 04:24:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:24:02,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:24:02,767 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 04:24:02,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:24:02,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:24:02,968 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 136 more)] === [2023-11-29 04:24:02,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:24:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1108586671, now seen corresponding path program 1 times [2023-11-29 04:24:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:24:02,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309934188] [2023-11-29 04:24:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:24:02,969 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 04:24:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:24:02,970 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:24:02,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:24:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:24:03,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:24:03,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:24:03,637 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 04:24:03,729 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:24:03,730 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 04:24:03,814 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 04:24:03,912 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 04:24:04,108 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:24:04,109 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 04:24:04,297 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:24:04,297 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 04:24:04,351 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 04:24:04,467 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 04:24:04,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:24:04,608 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1352) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:24:09,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1351 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1351))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1352)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:24:09,134 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1351 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1350 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1350))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1351)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1352)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:24:09,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:24:09,177 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 04:24:09,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4389 treesize of output 3534 [2023-11-29 04:24:09,273 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 1276 treesize of output 1122 [2023-11-29 04:24:09,287 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 1122 treesize of output 1010 [2023-11-29 04:24:09,311 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 1010 treesize of output 786 [2023-11-29 04:24:18,191 WARN L293 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 418 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 04:24:18,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:24:18,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 180 treesize of output 934 [2023-11-29 04:26:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 1 not checked. [2023-11-29 04:26:21,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309934188] [2023-11-29 04:26:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309934188] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:26:21,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:26:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-29 04:26:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901808572] [2023-11-29 04:26:21,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:21,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:26:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:26:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=186, Unknown=7, NotChecked=90, Total=342 [2023-11-29 04:26:21,542 INFO L87 Difference]: Start difference. First operand 350 states and 449 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 04:26:32,671 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 04:26:36,676 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 [1] [2023-11-29 04:26:40,685 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 [1] [2023-11-29 04:26:44,694 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 04:26:48,703 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 04:26:52,707 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 04:26:56,712 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 04:27:00,862 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 [1] [2023-11-29 04:27:04,883 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 [1] [2023-11-29 04:27:08,890 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 04:27:12,901 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 04:27:16,908 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 04:27:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:21,086 INFO L93 Difference]: Finished difference Result 407 states and 465 transitions. [2023-11-29 04:27:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:27:21,088 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 04:27:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:21,090 INFO L225 Difference]: With dead ends: 407 [2023-11-29 04:27:21,090 INFO L226 Difference]: Without dead ends: 407 [2023-11-29 04:27:21,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=82, Invalid=229, Unknown=7, NotChecked=102, Total=420 [2023-11-29 04:27:21,091 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 550 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 11 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 59.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:21,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1618 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1502 Invalid, 12 Unknown, 1154 Unchecked, 59.2s Time] [2023-11-29 04:27:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-29 04:27:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 349. [2023-11-29 04:27:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 226 states have (on average 1.8805309734513274) internal successors, (425), 332 states have internal predecessors, (425), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:27:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2023-11-29 04:27:21,098 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 44 [2023-11-29 04:27:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:21,098 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2023-11-29 04:27:21,099 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 04:27:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2023-11-29 04:27:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:27:21,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:21,099 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 04:27:21,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:21,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:27:21,300 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 136 more)] === [2023-11-29 04:27:21,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1108586672, now seen corresponding path program 1 times [2023-11-29 04:27:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352457228] [2023-11-29 04:27:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:21,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:27:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:21,302 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:21,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:22,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 04:27:22,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:22,071 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 04:27:22,134 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 04:27:22,168 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:27:22,168 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 04:27:22,251 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 04:27:22,295 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 04:27:22,431 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 04:27:22,460 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 04:27:22,706 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:27:22,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:27:22,736 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 04:27:23,082 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:27:23,083 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 04:27:23,095 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 04:27:23,272 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 04:27:23,284 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 04:27:23,345 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 04:27:23,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:24,219 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1484) |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~mem178#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:27:24,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1484) |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 04:27:24,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1482))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1481) .cse0 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1481) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-11-29 04:27:24,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1482))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1481) .cse2 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1481) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-29 04:27:24,962 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1479 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1480))) (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_~mem_track~0#1.base| v_ArrVal_1479) .cse2 v_ArrVal_1481) (select (select (store .cse3 .cse2 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1484))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1479 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1480))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1482))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (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_1479) .cse5 v_ArrVal_1481) .cse6 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 04:27:25,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:25,088 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 04:27:25,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:25,121 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 04:27:25,137 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 771 treesize of output 636 [2023-11-29 04:27:25,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 5511 treesize of output 5160 [2023-11-29 04:27:25,172 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 222 treesize of output 194 [2023-11-29 04:27:25,177 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 194 treesize of output 166 [2023-11-29 04:27:25,183 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 166 treesize of output 138 [2023-11-29 04:27:25,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 82 treesize of output 68 [2023-11-29 04:27:25,299 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 68 treesize of output 54 [2023-11-29 04:27:25,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:25,580 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 04:27:25,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:27:25,623 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 04:27:25,634 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:25,648 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 617 treesize of output 392 [2023-11-29 04:27:25,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:25,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:27:25,667 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 04:27:26,269 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:27:26,269 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 04:27:26,274 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 04:27:26,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:26,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352457228] [2023-11-29 04:27:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352457228] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:27:26,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-11-29 04:27:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48625083] [2023-11-29 04:27:26,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:26,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:27:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:27:26,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2023-11-29 04:27:26,277 INFO L87 Difference]: Start difference. First operand 349 states and 447 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 04:27:43,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:27:47,241 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 04:27:51,250 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 04:27:55,257 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 04:27:59,266 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 04:28:02,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:28:06,822 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 04:28:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:13,540 INFO L93 Difference]: Finished difference Result 415 states and 472 transitions. [2023-11-29 04:28:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:28:13,543 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 04:28:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:13,545 INFO L225 Difference]: With dead ends: 415 [2023-11-29 04:28:13,545 INFO L226 Difference]: Without dead ends: 415 [2023-11-29 04:28:13,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=126, Invalid=441, Unknown=5, NotChecked=240, Total=812 [2023-11-29 04:28:13,546 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 375 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 11 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1943 IncrementalHoareTripleChecker+Unchecked, 45.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:13,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1562 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2026 Invalid, 5 Unknown, 1943 Unchecked, 45.2s Time] [2023-11-29 04:28:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-11-29 04:28:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 355. [2023-11-29 04:28:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 232 states have (on average 1.8620689655172413) internal successors, (432), 338 states have internal predecessors, (432), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:28:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 454 transitions. [2023-11-29 04:28:13,555 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 454 transitions. Word has length 44 [2023-11-29 04:28:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:13,555 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 454 transitions. [2023-11-29 04:28:13,555 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 04:28:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 454 transitions. [2023-11-29 04:28:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 04:28:13,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:13,556 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 04:28:13,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:13,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:28:13,756 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 136 more)] === [2023-11-29 04:28:13,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1917137382, now seen corresponding path program 2 times [2023-11-29 04:28:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:13,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272895287] [2023-11-29 04:28:13,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:28:13,758 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 04:28:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:13,758 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:13,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:14,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:28:14,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:28:14,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 04:28:14,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:14,907 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 04:28:14,982 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 04:28:15,017 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:28:15,018 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 04:28:15,109 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 04:28:15,144 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 04:28:15,304 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 04:28:15,336 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 04:28:15,608 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:28:15,609 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 04:28:15,632 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 04:28:16,007 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:28:16,007 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 04:28:16,027 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 04:28:16,434 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:28:16,434 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 04:28:16,468 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 04:28:16,683 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 04:28:16,697 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 04:28:16,784 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 04:28:16,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:17,783 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1623) |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~mem178#1.base| v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1623) |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 04:28:17,915 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd .cse3 (_ bv1 64) .cse2))))))) is different from false [2023-11-29 04:28:18,113 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1621) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1622))) (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~mem178#1.base| v_ArrVal_1621) .cse3 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 04:28:18,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1622))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1621) .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1621) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-29 04:28:19,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1620))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1622))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1619) .cse1 v_ArrVal_1621) .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1620))) (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_#t~mem176#1.base| v_ArrVal_1619) .cse7 v_ArrVal_1621) (select (select (store .cse8 .cse7 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1623))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd (_ bv1 64) .cse0 .cse6)))))) is different from false [2023-11-29 04:28:22,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1620))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1622))) (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_1619) .cse1 v_ArrVal_1621) .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1620))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1619) .cse8 v_ArrVal_1621) (select (select (store .cse9 .cse8 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1623))) |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 04:28:24,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1624 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1617))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1620))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1622))) (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_~mem_track~0#1.base| v_ArrVal_1618) .cse0 v_ArrVal_1619) .cse1 v_ArrVal_1621) .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1624) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (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_1617))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1620))) (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_~mem_track~0#1.base| v_ArrVal_1618) .cse9 v_ArrVal_1619) .cse10 v_ArrVal_1621) (select (select (store .cse11 .cse10 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1623))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 (_ bv1 64) .cse4)))))) is different from false [2023-11-29 04:28:24,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:24,224 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 451 treesize of output 452 [2023-11-29 04:28:24,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:24,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-29 04:28:24,316 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 1666923 treesize of output 1374306 [2023-11-29 04:28:25,549 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 835292 treesize of output 822629 [2023-11-29 04:28:25,709 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 1745 treesize of output 1360 [2023-11-29 04:28:25,725 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 1360 treesize of output 1276 [2023-11-29 04:28:25,743 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 1276 treesize of output 1157 [2023-11-29 04:28:25,761 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 1157 treesize of output 954 [2023-11-29 04:28:25,779 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 954 treesize of output 919 [2023-11-29 04:28:25,841 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 288 treesize of output 225 [2023-11-29 04:28:25,859 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 856 treesize of output 779 [2023-11-29 04:28:25,932 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 211 treesize of output 204 [2023-11-29 04:28:57,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:57,404 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 04:28:57,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:28:57,456 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 04:28:57,497 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 33327 treesize of output 27792 [2023-11-29 04:28:57,629 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 98648 treesize of output 95903 [2023-11-29 04:28:57,725 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 2151 treesize of output 1983 [2023-11-29 04:28:57,749 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 1983 treesize of output 1703 [2023-11-29 04:28:57,774 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 1703 treesize of output 1591 [2023-11-29 04:28:57,799 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 1591 treesize of output 1311 [2023-11-29 04:28:57,824 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 1311 treesize of output 1255 [2023-11-29 04:28:57,849 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 1255 treesize of output 1143 [2023-11-29 04:28:57,875 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 1143 treesize of output 1003 [2023-11-29 04:28:59,721 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:28:59,722 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 04:28:59,727 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 04:28:59,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:59,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272895287] [2023-11-29 04:28:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272895287] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:59,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2023-11-29 04:28:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963822911] [2023-11-29 04:28:59,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:59,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 04:28:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:59,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 04:28:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=329, Unknown=7, NotChecked=294, Total=702 [2023-11-29 04:28:59,730 INFO L87 Difference]: Start difference. First operand 355 states and 454 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 04:29:23,869 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 04:29:27,877 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 04:29:31,887 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 04:29:35,897 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 04:29:39,914 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 04:29:43,926 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 04:29:47,931 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 04:29:51,942 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 04:29:55,951 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 04:30:00,191 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 04:30:04,202 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 04:30:08,219 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 04:30:12,228 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 04:30:16,241 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 04:30:20,252 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 04:30:24,262 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 04:30:28,274 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 04:30:32,286 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 04:30:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:30:40,338 INFO L93 Difference]: Finished difference Result 422 states and 479 transitions. [2023-11-29 04:30:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:30:40,341 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 04:30:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:30:40,343 INFO L225 Difference]: With dead ends: 422 [2023-11-29 04:30:40,343 INFO L226 Difference]: Without dead ends: 422 [2023-11-29 04:30:40,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=164, Invalid=669, Unknown=7, NotChecked=420, Total=1260 [2023-11-29 04:30:40,344 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 636 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 25 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 4768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 2762 IncrementalHoareTripleChecker+Unchecked, 97.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:30:40,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1645 Invalid, 4768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1963 Invalid, 18 Unknown, 2762 Unchecked, 97.0s Time] [2023-11-29 04:30:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-11-29 04:30:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 361. [2023-11-29 04:30:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 238 states have (on average 1.8445378151260505) internal successors, (439), 344 states have internal predecessors, (439), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:30:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 461 transitions. [2023-11-29 04:30:40,354 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 461 transitions. Word has length 47 [2023-11-29 04:30:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:30:40,354 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 461 transitions. [2023-11-29 04:30:40,354 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 04:30:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 461 transitions. [2023-11-29 04:30:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 04:30:40,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:30:40,355 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 04:30:40,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:30:40,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:30:40,556 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 136 more)] === [2023-11-29 04:30:40,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:30:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1020224272, now seen corresponding path program 3 times [2023-11-29 04:30:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:30:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899454436] [2023-11-29 04:30:40,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:30:40,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 04:30:40,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:30:40,558 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:30:40,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:30:42,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 04:30:42,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:30:42,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 04:30:42,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:30:42,188 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 04:30:42,313 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:30:42,313 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 04:30:42,343 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 04:30:42,469 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 04:30:42,517 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 04:30:42,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 04:30:42,740 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 04:30:43,069 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:30:43,069 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 04:30:43,101 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 04:30:43,614 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:30:43,615 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 04:30:43,656 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 04:30:44,200 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:30:44,200 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 04:30:44,244 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 04:30:44,814 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:30:44,814 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 04:30:44,833 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 04:30:45,155 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 04:30:45,178 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 04:30:45,306 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 04:30:45,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:30:46,447 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:30:46,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:30:46,808 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1770) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1769))) (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~mem178#1.base| v_ArrVal_1770) .cse3 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 04:30:50,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1767))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1769))) (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~mem178#1.base| v_ArrVal_1768) .cse0 v_ArrVal_1770) .cse1 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_1767))) (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~mem178#1.base| v_ArrVal_1768) .cse7 v_ArrVal_1770) (select (select (store .cse8 .cse7 v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1771))) |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 04:30:55,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1767))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1769))) (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_1768) .cse1 v_ArrVal_1770) .cse2 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1767))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1768) .cse8 v_ArrVal_1770) (select (select (store .cse9 .cse8 v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1771))) |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 04:30:59,608 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1765))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1767))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1769))) (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~mem176#1.base| v_ArrVal_1766) .cse0 v_ArrVal_1768) .cse1 v_ArrVal_1770) .cse2 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem176#1.base| v_ArrVal_1765))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1767))) (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~mem176#1.base| v_ArrVal_1766) .cse9 v_ArrVal_1768) .cse10 v_ArrVal_1770) (select (select (store .cse11 .cse10 v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1771))))) |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 04:31:04,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv3 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1765))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1767))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1769))) (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_1766) .cse2 v_ArrVal_1768) .cse3 v_ArrVal_1770) .cse4 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))) (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1765))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1767))) (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_1766) .cse10 v_ArrVal_1768) .cse11 v_ArrVal_1770) (select (select (store .cse12 .cse11 v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1771))))) |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 04:31:09,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ sign_extend 32) (_ bv3 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1764))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_1765))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_1767))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_1769))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1763) .cse0 v_ArrVal_1766) .cse1 v_ArrVal_1768) .cse2 v_ArrVal_1770) .cse3 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse5 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_1767 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1769 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1768 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1765 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1770 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1764))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_1765))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_1767))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1763) .cse11 v_ArrVal_1766) .cse12 v_ArrVal_1768) .cse13 v_ArrVal_1770) (select (select (store .cse14 .cse13 v_ArrVal_1769) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1771))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse10 .cse5) (bvadd .cse10 .cse5 (_ bv1 64))))))) is different from false [2023-11-29 04:31:10,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:10,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 888 [2023-11-29 04:31:10,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:10,186 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 04:31:10,299 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 7610847 treesize of output 6343512 [2023-11-29 04:31:13,002 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 431304 treesize of output 423375 [2023-11-29 04:31:13,261 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 4415 treesize of output 3911 [2023-11-29 04:31:13,322 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 3911 treesize of output 3183 [2023-11-29 04:31:13,383 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 3183 treesize of output 2679 [2023-11-29 04:31:13,446 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 2679 treesize of output 2567 [2023-11-29 04:31:13,506 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 2455 [2023-11-29 04:31:13,567 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 2455 treesize of output 2203 [2023-11-29 04:31:13,629 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 2147 [2023-11-29 04:31:13,697 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 2147 treesize of output 2035 [2023-11-29 04:31:13,756 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 2035 treesize of output 1923 [2023-11-29 04:31:25,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:25,594 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 04:31:25,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:31:25,719 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 04:31:25,750 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:31:25,827 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 1842667 treesize of output 1282570 [2023-11-29 04:31:27,354 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:31:27,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:31:27,381 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 04:31:30,019 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:31:30,020 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 04:31:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 16 not checked. [2023-11-29 04:31:30,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899454436] [2023-11-29 04:31:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899454436] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:31:30,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:31:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 04:31:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463244605] [2023-11-29 04:31:30,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:30,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 04:31:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 04:31:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=353, Unknown=11, NotChecked=360, Total=812 [2023-11-29 04:31:30,029 INFO L87 Difference]: Start difference. First operand 361 states and 461 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 04:32:00,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:32:02,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:32:02,992 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~j~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse4 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd .cse0 (_ bv1 64) .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|))) (bvule (bvadd .cse0 .cse1) .cse2) (forall ((v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse3 .cse4) (bvadd (_ bv1 64) .cse3 .cse4)))) (forall ((v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (bvule .cse2 (select |c_#length| .cse5)))))) is different from false [2023-11-29 04:32:03,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~j~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse4 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd .cse0 (_ bv1 64) .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (bvule (bvadd .cse0 .cse1) .cse2) (forall ((v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse3 .cse4) (bvadd (_ bv1 64) .cse3 .cse4)))) (forall ((v_ArrVal_1772 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1771 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1771) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1772) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))) (bvule .cse2 (select |c_#length| .cse5)))))) is different from false [2023-11-29 04:32:46,592 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 04:32:50,611 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 04:32:54,627 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 04:32:58,640 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 04:33:02,646 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 04:33:06,657 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 04:33:09,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:33:13,861 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 04:33:17,871 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 04:33:21,884 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 04:33:25,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 [1] [2023-11-29 04:33:29,910 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 04:33:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:40,464 INFO L93 Difference]: Finished difference Result 374 states and 476 transitions. [2023-11-29 04:33:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:33:40,472 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 04:33:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:40,474 INFO L225 Difference]: With dead ends: 374 [2023-11-29 04:33:40,474 INFO L226 Difference]: Without dead ends: 374 [2023-11-29 04:33:40,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=264, Invalid=1013, Unknown=23, NotChecked=770, Total=2070 [2023-11-29 04:33:40,476 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 41 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 12 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 1337 IncrementalHoareTripleChecker+Unchecked, 100.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:40,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2982 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1273 Invalid, 19 Unknown, 1337 Unchecked, 100.3s Time] [2023-11-29 04:33:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-29 04:33:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2023-11-29 04:33:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 250 states have (on average 1.812) internal successors, (453), 356 states have internal predecessors, (453), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:33:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 475 transitions. [2023-11-29 04:33:40,484 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 475 transitions. Word has length 50 [2023-11-29 04:33:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:40,484 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 475 transitions. [2023-11-29 04:33:40,484 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 04:33:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2023-11-29 04:33:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 04:33:40,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:40,485 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:33:40,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:33:40,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:33:40,685 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 136 more)] === [2023-11-29 04:33:40,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2012132181, now seen corresponding path program 1 times [2023-11-29 04:33:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856033339] [2023-11-29 04:33:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:40,687 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 04:33:40,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:40,688 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:33:40,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:33:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:41,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:33:41,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:33:42,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:33:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:33:45,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:33:45,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856033339] [2023-11-29 04:33:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856033339] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:33:45,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:33:45,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:33:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423718399] [2023-11-29 04:33:45,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:33:45,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:33:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:33:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:33:45,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:33:45,296 INFO L87 Difference]: Start difference. First operand 373 states and 475 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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 04:33:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:57,358 INFO L93 Difference]: Finished difference Result 414 states and 513 transitions. [2023-11-29 04:33:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:33:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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 57 [2023-11-29 04:33:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:57,363 INFO L225 Difference]: With dead ends: 414 [2023-11-29 04:33:57,364 INFO L226 Difference]: Without dead ends: 414 [2023-11-29 04:33:57,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:33:57,365 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 57 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:57,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 2291 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-11-29 04:33:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2023-11-29 04:33:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 399. [2023-11-29 04:33:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 276 states have (on average 1.7789855072463767) internal successors, (491), 382 states have internal predecessors, (491), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:33:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 513 transitions. [2023-11-29 04:33:57,373 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 513 transitions. Word has length 57 [2023-11-29 04:33:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:57,374 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 513 transitions. [2023-11-29 04:33:57,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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 04:33:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 513 transitions. [2023-11-29 04:33:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 04:33:57,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:57,374 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:33:57,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 04:33:57,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:33:57,575 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 136 more)] === [2023-11-29 04:33:57,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1722292880, now seen corresponding path program 4 times [2023-11-29 04:33:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133311691] [2023-11-29 04:33:57,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:33:57,576 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 04:33:57,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:57,577 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:33:57,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 04:33:59,127 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:33:59,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:33:59,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 04:33:59,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:59,205 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 04:33:59,661 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 04:33:59,991 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:33:59,992 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 04:34:00,371 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 04:34:00,477 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 04:34:01,243 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 04:34:01,383 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 04:34:02,545 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:02,546 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 04:34:02,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 04:34:04,383 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:04,383 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 04:34:04,435 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 04:34:06,368 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:06,368 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 04:34:06,424 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 04:34:08,464 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:08,464 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 04:34:08,564 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 04:34:10,760 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:10,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:34:10,851 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 04:34:12,977 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:12,977 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 04:34:13,075 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 04:34:15,539 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:15,539 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 04:34:15,681 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 04:34:18,306 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:34:18,307 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 04:34:18,360 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 04:34:19,738 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 04:34:19,826 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 04:34:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:34:20,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:34:23,358 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~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2099) |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~mem178#1.base| v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2099) |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 04:34:23,647 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_2099 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:34:24,089 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2097))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2096) .cse0 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2096) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-11-29 04:34:27,000 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2097))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2096) .cse2 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2096) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-29 04:34:28,059 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2095))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_2097))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2094) .cse0 v_ArrVal_2096) .cse1 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2095))) (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~mem178#1.base| v_ArrVal_2094) .cse7 v_ArrVal_2096) (select (select (store .cse8 .cse7 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2099))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd (_ bv1 64) .cse6 .cse3)))))) is different from false [2023-11-29 04:34:32,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#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_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2095))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_2097))) (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_2094) .cse1 v_ArrVal_2096) .cse2 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2095))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2094) .cse8 v_ArrVal_2096) (select (select (store .cse9 .cse8 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2099))) |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 04:34:37,050 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2093))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_2095))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_2097))) (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~mem178#1.base| v_ArrVal_2092) .cse0 v_ArrVal_2094) .cse1 v_ArrVal_2096) .cse2 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2093))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2095))) (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~mem178#1.base| v_ArrVal_2092) .cse9 v_ArrVal_2094) .cse10 v_ArrVal_2096) (select (select (store .cse11 .cse10 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2099))))) |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 04:34:42,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2093))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_2095))) (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_2092) .cse3 v_ArrVal_2094) .cse4 v_ArrVal_2096) (select (select (store .cse5 .cse4 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2099))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2093))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2095))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2097))) (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_2092) .cse8 v_ArrVal_2094) .cse9 v_ArrVal_2096) .cse10 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-29 04:34:47,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv5 32)))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2091))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2093))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_2095))) (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_#t~mem178#1.base| v_ArrVal_2090) .cse2 v_ArrVal_2092) .cse3 v_ArrVal_2094) .cse4 v_ArrVal_2096) (select (select (store .cse5 .cse4 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2099))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2091))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_2093))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2095))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2097))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2090) .cse9 v_ArrVal_2092) .cse10 v_ArrVal_2094) .cse11 v_ArrVal_2096) .cse12 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) is different from false [2023-11-29 04:34:52,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv5 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (and (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2091))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2093))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_2095))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2090) .cse3 v_ArrVal_2092) .cse4 v_ArrVal_2094) .cse5 v_ArrVal_2096) (select (select (store .cse6 .cse5 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2099))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2091))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2093))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2095))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2097))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2090) .cse10 v_ArrVal_2092) .cse11 v_ArrVal_2094) .cse12 v_ArrVal_2096) .cse13 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))))))))) is different from false [2023-11-29 04:34:57,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2089))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_2091))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_2093))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_2095))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2097))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2088) .cse1 v_ArrVal_2090) .cse2 v_ArrVal_2092) .cse3 v_ArrVal_2094) .cse4 v_ArrVal_2096) .cse5 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2089))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_2091))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_2093))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_2095))) (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_#t~mem178#1.base| v_ArrVal_2088) .cse13 v_ArrVal_2090) .cse14 v_ArrVal_2092) .cse15 v_ArrVal_2094) .cse16 v_ArrVal_2096) (select (select (store .cse17 .cse16 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_2099))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse12) (bvadd (_ bv1 64) .cse0 .cse12)))))) is different from false [2023-11-29 04:35:02,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (and (forall ((v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2089))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_2091))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_2093))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_2095))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2088) .cse3 v_ArrVal_2090) .cse4 v_ArrVal_2092) .cse5 v_ArrVal_2094) .cse6 v_ArrVal_2096) (select (select (store .cse7 .cse6 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_2099))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2089))) (let ((.cse12 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse20 (store .cse21 .cse12 v_ArrVal_2091))) (let ((.cse13 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse19 (store .cse20 .cse13 v_ArrVal_2093))) (let ((.cse14 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse18 (store .cse19 .cse14 v_ArrVal_2095))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_2097))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2088) .cse12 v_ArrVal_2090) .cse13 v_ArrVal_2092) .cse14 v_ArrVal_2094) .cse15 v_ArrVal_2096) .cse16 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))))))))))))))))) is different from false [2023-11-29 04:35:07,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv7 32)))) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2087 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2098 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2086 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2087))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_2089))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_2091))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_2093))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_2095))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_2097))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2086) .cse1 v_ArrVal_2088) .cse2 v_ArrVal_2090) .cse3 v_ArrVal_2092) .cse4 v_ArrVal_2094) .cse5 v_ArrVal_2096) .cse6 v_ArrVal_2099) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_2098) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))))) (forall ((v_ArrVal_2089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2099 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2096 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2087 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2086 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2090 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2087))) (let ((.cse15 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse15 v_ArrVal_2089))) (let ((.cse16 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse22 (store .cse23 .cse16 v_ArrVal_2091))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_2093))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_2095))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem178#1.base| v_ArrVal_2086) .cse15 v_ArrVal_2088) .cse16 v_ArrVal_2090) .cse17 v_ArrVal_2092) .cse18 v_ArrVal_2094) .cse19 v_ArrVal_2096) (select (select (store .cse20 .cse19 v_ArrVal_2097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_2099))))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd .cse0 .cse14) (bvadd .cse0 (_ bv1 64) .cse14)))))) is different from false [2023-11-29 04:35:12,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 04:35:12,495 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 04:35:12,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:35:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133311691] [2023-11-29 04:35:12,497 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 04:35:12,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 04:35:12,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:35:12,697 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2023-11-29 04:35:12,700 INFO L158 Benchmark]: Toolchain (without parser) took 815794.80ms. Allocated memory was 75.5MB in the beginning and 423.6MB in the end (delta: 348.1MB). Free memory was 40.5MB in the beginning and 196.6MB in the end (delta: -156.1MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,701 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:35:12,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1483.34ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 46.7MB in the end (delta: -6.4MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.73ms. Allocated memory is still 92.3MB. Free memory was 46.7MB in the beginning and 40.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,701 INFO L158 Benchmark]: Boogie Preprocessor took 109.77ms. Allocated memory is still 92.3MB. Free memory was 40.6MB in the beginning and 55.4MB in the end (delta: -14.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,702 INFO L158 Benchmark]: RCFGBuilder took 6533.90ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 55.4MB in the beginning and 73.8MB in the end (delta: -18.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,702 INFO L158 Benchmark]: TraceAbstraction took 807557.69ms. Allocated memory was 113.2MB in the beginning and 423.6MB in the end (delta: 310.4MB). Free memory was 73.2MB in the beginning and 196.6MB in the end (delta: -123.4MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. [2023-11-29 04:35:12,703 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.13ms. Allocated memory is still 52.4MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1483.34ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 46.7MB in the end (delta: -6.4MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.73ms. Allocated memory is still 92.3MB. Free memory was 46.7MB in the beginning and 40.6MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.77ms. Allocated memory is still 92.3MB. Free memory was 40.6MB in the beginning and 55.4MB in the end (delta: -14.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 6533.90ms. Allocated memory was 92.3MB in the beginning and 113.2MB in the end (delta: 21.0MB). Free memory was 55.4MB in the beginning and 73.8MB in the end (delta: -18.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 807557.69ms. Allocated memory was 113.2MB in the beginning and 423.6MB in the end (delta: 310.4MB). Free memory was 73.2MB in the beginning and 196.6MB in the end (delta: -123.4MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1609bfdc-83b1-4b4d-8831-3b768f6bfb9a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")