./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:15:19,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:15:19,503 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-09 07:15:19,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:15:19,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:15:19,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:15:19,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:15:19,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:15:19,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:15:19,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:15:19,555 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:15:19,555 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:15:19,556 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:15:19,556 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:15:19,556 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:15:19,557 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:15:19,557 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:15:19,561 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:15:19,562 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:15:19,562 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:15:19,562 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:15:19,563 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:15:19,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:15:19,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:15:19,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:15:19,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:15:19,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:15:19,565 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:15:19,565 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:15:19,566 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:15:19,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:15:19,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:15:19,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:15:19,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:15:19,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:15:19,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:15:19,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:15:19,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:15:19,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:15:19,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:15:19,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:15:19,574 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:15:19,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:15:19,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:15:19,575 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:15:19,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:15:19,576 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/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_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 [2024-11-09 07:15:19,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:15:19,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:15:19,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:15:19,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:15:19,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:15:19,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i Unable to find full path for "g++" [2024-11-09 07:15:22,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:15:22,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:15:22,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-09 07:15:22,450 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/7220c229a/cdbae354058a426fa706101b29891e03/FLAG090b5aa13 [2024-11-09 07:15:22,649 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/7220c229a/cdbae354058a426fa706101b29891e03 [2024-11-09 07:15:22,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:15:22,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:15:22,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:22,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:15:22,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:15:22,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:22" (1/1) ... [2024-11-09 07:15:22,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c381077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:22, skipping insertion in model container [2024-11-09 07:15:22,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:22" (1/1) ... [2024-11-09 07:15:22,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:23,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:23,201 ERROR L321 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) [2024-11-09 07:15:23,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@55b09f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:23, skipping insertion in model container [2024-11-09 07:15:23,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:23,203 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:15:23,206 INFO L158 Benchmark]: Toolchain (without parser) took 544.84ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 114.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:15:23,206 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 125.8MB. Free memory was 66.5MB in the beginning and 66.4MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:15:23,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.88ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 114.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:15:23,209 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.36ms. Allocated memory is still 125.8MB. Free memory was 66.5MB in the beginning and 66.4MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.88ms. Allocated memory is still 176.2MB. Free memory was 132.5MB in the beginning and 114.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2493]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:15:25,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:15:25,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Bitvector.epf [2024-11-09 07:15:25,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:15:25,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:15:25,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:15:25,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:15:25,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:15:25,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:15:25,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:15:25,942 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:15:25,943 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:15:25,944 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:15:25,946 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:15:25,947 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:15:25,947 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:15:25,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:15:25,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:15:25,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:15:25,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:15:25,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:15:25,956 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:15:25,956 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:15:25,957 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:15:25,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:15:25,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:15:25,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:15:25,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:15:25,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:15:25,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:15:25,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:15:25,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:15:25,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:15:25,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:15:25,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:15:25,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:15:25,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:15:25,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:15:25,965 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 07:15:25,965 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:15:25,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:15:25,967 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:15:25,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/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_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 225e0f8ec8427769f807cb9abdb48fc1d5aa020788f9d77d633e751d0afad499 [2024-11-09 07:15:26,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:15:26,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:15:26,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:15:26,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:15:26,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:15:26,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i Unable to find full path for "g++" [2024-11-09 07:15:28,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:15:29,078 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:15:29,079 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/sv-benchmarks/c/memsafety-broom/linux-list-middle-data.i [2024-11-09 07:15:29,130 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/c6e5e6d14/c8485856bd1c4efcac1b77874fe84d43/FLAG0c0e8dd23 [2024-11-09 07:15:29,154 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/data/c6e5e6d14/c8485856bd1c4efcac1b77874fe84d43 [2024-11-09 07:15:29,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:15:29,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:15:29,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:29,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:15:29,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:15:29,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:29" (1/1) ... [2024-11-09 07:15:29,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe44b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:29, skipping insertion in model container [2024-11-09 07:15:29,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:29" (1/1) ... [2024-11-09 07:15:29,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:29,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:29,819 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:15:29,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:29,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:29,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:15:29,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:30,031 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:15:30,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30 WrapperNode [2024-11-09 07:15:30,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:30,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:15:30,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:15:30,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:15:30,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,102 INFO L138 Inliner]: procedures = 125, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 102 [2024-11-09 07:15:30,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:15:30,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:15:30,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:15:30,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:15:30,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:15:30,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:15:30,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:15:30,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:15:30,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (1/1) ... [2024-11-09 07:15:30,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:15:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:15:30,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:15:30,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:15:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:15:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:15:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:15:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:15:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 07:15:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:15:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:15:30,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:15:30,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:15:31,340 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2024-11-09 07:15:31,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:15:31,356 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:15:31,357 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:15:31,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:15:31 BoogieIcfgContainer [2024-11-09 07:15:31,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:15:31,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:15:31,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:15:31,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:15:31,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:15:29" (1/3) ... [2024-11-09 07:15:31,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f2a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:15:31, skipping insertion in model container [2024-11-09 07:15:31,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:30" (2/3) ... [2024-11-09 07:15:31,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f2a8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:15:31, skipping insertion in model container [2024-11-09 07:15:31,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:15:31" (3/3) ... [2024-11-09 07:15:31,371 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-list-middle-data.i [2024-11-09 07:15:31,391 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:15:31,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2024-11-09 07:15:31,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:15:31,466 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@45bf7a9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:15:31,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-11-09 07:15:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 55 states have (on average 2.0) internal successors, (110), 102 states have internal predecessors, (110), 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) [2024-11-09 07:15:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:15:31,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:31,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:15:31,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:31,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2024-11-09 07:15:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892489449] [2024-11-09 07:15:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:31,512 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 [2024-11-09 07:15:31,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:31,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:31,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:31,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:15:31,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:31,717 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 [2024-11-09 07:15:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:31,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:31,738 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:31,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892489449] [2024-11-09 07:15:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892489449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:15:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672282728] [2024-11-09 07:15:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:31,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:15:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:31,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:15:31,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:31,793 INFO L87 Difference]: Start difference. First operand has 103 states, 55 states have (on average 2.0) internal successors, (110), 102 states have internal predecessors, (110), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 07:15:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:32,168 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-09 07:15:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:15:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 07:15:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:32,183 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:15:32,184 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:15:32,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:32,192 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:32,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:15:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:15:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:15:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 98 states have internal predecessors, (103), 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) [2024-11-09 07:15:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-09 07:15:32,244 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 3 [2024-11-09 07:15:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-09 07:15:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 07:15:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-09 07:15:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:15:32,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:32,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:15:32,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:32,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:32,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2024-11-09 07:15:32,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482467722] [2024-11-09 07:15:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:32,451 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 [2024-11-09 07:15:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:32,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:32,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:32,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:15:32,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:32,520 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 [2024-11-09 07:15:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:32,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:32,541 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482467722] [2024-11-09 07:15:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482467722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:15:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486086693] [2024-11-09 07:15:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:32,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:15:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:15:32,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:32,545 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 07:15:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:33,134 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-09 07:15:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:15:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 07:15:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:33,137 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:15:33,137 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:15:33,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:33,139 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:33,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:15:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:15:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-09 07:15:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 96 states have internal predecessors, (101), 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) [2024-11-09 07:15:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-09 07:15:33,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 3 [2024-11-09 07:15:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:33,150 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-09 07:15:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 07:15:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-09 07:15:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:15:33,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:33,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:33,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:33,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:33,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:33,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash 148077583, now seen corresponding path program 1 times [2024-11-09 07:15:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:33,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121924374] [2024-11-09 07:15:33,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:33,355 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 [2024-11-09 07:15:33,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:33,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:33,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:33,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:15:33,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:33,474 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 [2024-11-09 07:15:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:33,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:33,487 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121924374] [2024-11-09 07:15:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121924374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:15:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717613387] [2024-11-09 07:15:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:15:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:15:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:33,494 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 07:15:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:33,879 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-11-09 07:15:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:15:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-09 07:15:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:33,881 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:15:33,881 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:15:33,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:33,883 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:33,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 143 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:15:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:15:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 07:15:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 94 states have internal predecessors, (99), 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) [2024-11-09 07:15:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-09 07:15:33,891 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 8 [2024-11-09 07:15:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:33,891 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-09 07:15:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 07:15:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-09 07:15:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:15:33,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:33,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:33,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:15:34,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:34,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:34,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 148077584, now seen corresponding path program 1 times [2024-11-09 07:15:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271087861] [2024-11-09 07:15:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:34,097 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 [2024-11-09 07:15:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:34,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:34,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:34,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:15:34,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:34,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:15:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:34,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:34,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271087861] [2024-11-09 07:15:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271087861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:34,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:34,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:15:34,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290918664] [2024-11-09 07:15:34,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:34,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:15:34,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:34,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:15:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:34,230 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 07:15:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:34,646 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-09 07:15:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:15:34,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-09 07:15:34,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:34,648 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:15:34,649 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:15:34,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:34,650 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:34,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:15:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:15:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 07:15:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 92 states have internal predecessors, (97), 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) [2024-11-09 07:15:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 07:15:34,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 8 [2024-11-09 07:15:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:34,666 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 07:15:34,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-09 07:15:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 07:15:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:15:34,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:34,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:34,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:34,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 568607665, now seen corresponding path program 1 times [2024-11-09 07:15:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163484348] [2024-11-09 07:15:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:34,870 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 [2024-11-09 07:15:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:34,879 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:34,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:34,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:15:34,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:34,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:15:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:35,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:35,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163484348] [2024-11-09 07:15:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163484348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820757769] [2024-11-09 07:15:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:35,060 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:35,635 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 07:15:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:35,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:15:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:35,655 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:15:35,655 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:15:35,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:35,657 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:35,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:15:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:15:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-09 07:15:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 91 states have internal predecessors, (96), 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) [2024-11-09 07:15:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-09 07:15:35,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 10 [2024-11-09 07:15:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:35,672 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-09 07:15:35,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-09 07:15:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:15:35,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:35,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:35,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:35,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 568607666, now seen corresponding path program 1 times [2024-11-09 07:15:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:35,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404223278] [2024-11-09 07:15:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:35,879 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 [2024-11-09 07:15:35,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:35,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:35,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:35,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:15:35,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:36,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:15:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:36,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:36,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404223278] [2024-11-09 07:15:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404223278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:36,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911454999] [2024-11-09 07:15:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:36,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:36,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:36,235 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:36,944 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2024-11-09 07:15:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:15:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:36,947 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:15:36,947 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:15:36,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:36,949 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:36,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 237 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:15:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:15:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2024-11-09 07:15:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.728813559322034) internal successors, (102), 96 states have internal predecessors, (102), 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) [2024-11-09 07:15:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-09 07:15:36,959 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 10 [2024-11-09 07:15:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:36,960 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-09 07:15:36,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-09 07:15:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:15:36,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:36,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:36,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:37,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:37,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash 998826193, now seen corresponding path program 1 times [2024-11-09 07:15:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:37,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271860597] [2024-11-09 07:15:37,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:37,164 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 [2024-11-09 07:15:37,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:37,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:37,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:37,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:15:37,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:37,400 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 [2024-11-09 07:15:37,455 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:15:37,455 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 [2024-11-09 07:15:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:37,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:37,505 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271860597] [2024-11-09 07:15:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271860597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:15:37,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318396211] [2024-11-09 07:15:37,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:37,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:15:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:37,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:15:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:37,507 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:37,948 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-11-09 07:15:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:15:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:15:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:37,950 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:15:37,950 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:15:37,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:37,952 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 20 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:37,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 163 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:15:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:15:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:15:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 95 states have internal predecessors, (101), 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) [2024-11-09 07:15:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2024-11-09 07:15:37,965 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 12 [2024-11-09 07:15:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:37,966 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2024-11-09 07:15:37,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2024-11-09 07:15:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:15:37,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:37,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:37,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 07:15:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:38,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:38,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 998826194, now seen corresponding path program 1 times [2024-11-09 07:15:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:38,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198229141] [2024-11-09 07:15:38,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:38,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:38,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:38,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:38,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:38,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:15:38,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:38,476 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 [2024-11-09 07:15:38,490 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 [2024-11-09 07:15:38,660 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:15:38,661 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 13 [2024-11-09 07:15:38,696 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:15:38,697 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 [2024-11-09 07:15:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:38,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:38,842 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198229141] [2024-11-09 07:15:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198229141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:38,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:38,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395814637] [2024-11-09 07:15:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:38,845 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 07:15:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:39,755 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-09 07:15:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:15:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:39,758 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:15:39,758 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:15:39,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:15:39,759 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 22 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:39,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:15:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:15:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 07:15:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.694915254237288) internal successors, (100), 94 states have internal predecessors, (100), 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) [2024-11-09 07:15:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-09 07:15:39,765 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 12 [2024-11-09 07:15:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-09 07:15:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 07:15:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-09 07:15:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:15:39,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:39,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:39,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:39,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1238973923, now seen corresponding path program 1 times [2024-11-09 07:15:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323126229] [2024-11-09 07:15:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:39,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 [2024-11-09 07:15:39,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:39,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:39,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:40,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:15:40,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:40,092 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 [2024-11-09 07:15:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:40,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:40,182 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323126229] [2024-11-09 07:15:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323126229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:40,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:15:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477386804] [2024-11-09 07:15:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:40,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:15:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:15:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:15:40,185 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:40,982 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2024-11-09 07:15:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:15:40,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:15:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:40,984 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:15:40,984 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:15:40,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:15:40,985 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:40,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 187 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:15:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:15:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2024-11-09 07:15:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.6875) internal successors, (108), 98 states have internal predecessors, (108), 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) [2024-11-09 07:15:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-09 07:15:40,991 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 14 [2024-11-09 07:15:40,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:40,991 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-09 07:15:40,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-09 07:15:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:15:40,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:40,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:41,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:41,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:41,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:41,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1238973924, now seen corresponding path program 1 times [2024-11-09 07:15:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:41,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118130011] [2024-11-09 07:15:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:41,194 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 [2024-11-09 07:15:41,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:41,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:41,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:41,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:15:41,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:41,308 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 [2024-11-09 07:15:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:41,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:41,482 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118130011] [2024-11-09 07:15:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118130011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:15:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299821780] [2024-11-09 07:15:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:41,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:15:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:41,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:15:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:15:41,485 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:42,384 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2024-11-09 07:15:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:15:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:15:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:42,385 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:15:42,385 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:15:42,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:15:42,386 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:42,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 246 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:15:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:15:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2024-11-09 07:15:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.7473684210526317) internal successors, (166), 129 states have internal predecessors, (166), 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) [2024-11-09 07:15:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2024-11-09 07:15:42,391 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 14 [2024-11-09 07:15:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:42,392 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2024-11-09 07:15:42,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2024-11-09 07:15:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:15:42,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:42,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:42,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:42,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:42,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2094264722, now seen corresponding path program 1 times [2024-11-09 07:15:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932512803] [2024-11-09 07:15:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:42,599 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 [2024-11-09 07:15:42,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:42,601 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:42,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:42,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:15:42,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:42,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:42,864 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932512803] [2024-11-09 07:15:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932512803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:15:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153561789] [2024-11-09 07:15:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:15:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:15:42,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:42,866 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:43,278 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2024-11-09 07:15:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:15:43,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:15:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:43,280 INFO L225 Difference]: With dead ends: 129 [2024-11-09 07:15:43,280 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 07:15:43,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:43,281 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:43,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:15:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 07:15:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-09 07:15:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.736842105263158) internal successors, (165), 128 states have internal predecessors, (165), 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) [2024-11-09 07:15:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2024-11-09 07:15:43,287 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 14 [2024-11-09 07:15:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2024-11-09 07:15:43,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2024-11-09 07:15:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:15:43,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:43,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:43,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:15:43,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:43,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:43,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2094264723, now seen corresponding path program 1 times [2024-11-09 07:15:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:43,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400004455] [2024-11-09 07:15:43,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:43,493 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 [2024-11-09 07:15:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:43,494 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:43,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:43,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:15:43,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:43,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:43,792 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400004455] [2024-11-09 07:15:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400004455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:43,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:43,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:15:43,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658137485] [2024-11-09 07:15:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:43,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:15:43,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:43,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:15:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:15:43,794 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:44,375 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2024-11-09 07:15:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:15:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:15:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:44,377 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:15:44,377 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:15:44,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:15:44,378 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 19 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:44,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 328 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:15:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:15:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 07:15:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.7263157894736842) internal successors, (164), 127 states have internal predecessors, (164), 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) [2024-11-09 07:15:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 164 transitions. [2024-11-09 07:15:44,383 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 164 transitions. Word has length 14 [2024-11-09 07:15:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:44,383 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 164 transitions. [2024-11-09 07:15:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 164 transitions. [2024-11-09 07:15:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:15:44,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:44,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:44,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:44,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:44,585 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash -246911177, now seen corresponding path program 1 times [2024-11-09 07:15:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356868545] [2024-11-09 07:15:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:44,587 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 [2024-11-09 07:15:44,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:44,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:44,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:44,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:15:44,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:44,732 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 [2024-11-09 07:15:44,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:15:44,787 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 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:15:45,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:45,048 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 24 treesize of output 10 [2024-11-09 07:15:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:45,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:45,130 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356868545] [2024-11-09 07:15:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356868545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:45,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:15:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872846483] [2024-11-09 07:15:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:45,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:15:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:15:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:15:45,133 INFO L87 Difference]: Start difference. First operand 128 states and 164 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:46,329 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2024-11-09 07:15:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:15:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:15:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:46,331 INFO L225 Difference]: With dead ends: 135 [2024-11-09 07:15:46,331 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 07:15:46,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:15:46,335 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 35 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:46,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 304 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:15:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 07:15:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-09 07:15:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.7272727272727273) internal successors, (171), 131 states have internal predecessors, (171), 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) [2024-11-09 07:15:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2024-11-09 07:15:46,340 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 15 [2024-11-09 07:15:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:46,340 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2024-11-09 07:15:46,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2024-11-09 07:15:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:15:46,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:46,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:46,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:46,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:46,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:46,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -246911176, now seen corresponding path program 1 times [2024-11-09 07:15:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:46,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714156569] [2024-11-09 07:15:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:46,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:46,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:46,547 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:46,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:46,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:15:46,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:15:46,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:15:46,769 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 19 treesize of output 18 [2024-11-09 07:15:46,787 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 19 treesize of output 18 [2024-11-09 07:15:47,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:47,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-09 07:15:47,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:47,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2024-11-09 07:15:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:47,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:47,198 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714156569] [2024-11-09 07:15:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714156569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:15:47,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094623193] [2024-11-09 07:15:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:15:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:15:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:15:47,200 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:48,387 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2024-11-09 07:15:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:15:48,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:15:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:48,390 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:15:48,390 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:15:48,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:15:48,391 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 27 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:48,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 433 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:15:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:15:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-09 07:15:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 123 states have internal predecessors, (156), 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) [2024-11-09 07:15:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 156 transitions. [2024-11-09 07:15:48,397 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 156 transitions. Word has length 15 [2024-11-09 07:15:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:48,397 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 156 transitions. [2024-11-09 07:15:48,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2024-11-09 07:15:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:15:48,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:48,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:48,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:48,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:48,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:48,602 INFO L85 PathProgramCache]: Analyzing trace with hash 497696954, now seen corresponding path program 1 times [2024-11-09 07:15:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744133679] [2024-11-09 07:15:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:48,603 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 [2024-11-09 07:15:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:48,607 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:48,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:48,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:15:48,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:48,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:15:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:48,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:48,916 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744133679] [2024-11-09 07:15:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744133679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070999227] [2024-11-09 07:15:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:48,918 INFO L87 Difference]: Start difference. First operand 124 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:49,526 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2024-11-09 07:15:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:49,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:15:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:49,528 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:15:49,528 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:15:49,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:49,529 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:49,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:15:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:15:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 07:15:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 91 states have (on average 1.6923076923076923) internal successors, (154), 121 states have internal predecessors, (154), 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) [2024-11-09 07:15:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2024-11-09 07:15:49,534 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 15 [2024-11-09 07:15:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2024-11-09 07:15:49,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2024-11-09 07:15:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:15:49,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:49,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:49,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:49,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 497696955, now seen corresponding path program 1 times [2024-11-09 07:15:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890040341] [2024-11-09 07:15:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:49,741 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 [2024-11-09 07:15:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:49,742 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:49,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:49,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:15:49,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:49,960 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 [2024-11-09 07:15:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:50,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:50,093 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890040341] [2024-11-09 07:15:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890040341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:50,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:50,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717293465] [2024-11-09 07:15:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:50,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:50,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:50,095 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:50,801 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2024-11-09 07:15:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:15:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:50,803 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:15:50,803 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:15:50,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:50,804 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:50,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:15:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:15:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:15:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 91 states have (on average 1.6703296703296704) internal successors, (152), 119 states have internal predecessors, (152), 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) [2024-11-09 07:15:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2024-11-09 07:15:50,809 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 15 [2024-11-09 07:15:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:50,809 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2024-11-09 07:15:50,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2024-11-09 07:15:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:15:50,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:50,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:50,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Forceful destruction successful, exit code 0 [2024-11-09 07:15:51,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:51,011 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 948000836, now seen corresponding path program 1 times [2024-11-09 07:15:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431596242] [2024-11-09 07:15:51,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:51,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 [2024-11-09 07:15:51,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:51,016 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:51,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:51,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:15:51,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:51,139 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 [2024-11-09 07:15:51,451 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 15 treesize of output 7 [2024-11-09 07:15:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:51,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:51,525 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431596242] [2024-11-09 07:15:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431596242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:15:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210423415] [2024-11-09 07:15:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:15:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:15:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:15:51,527 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-09 07:15:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:53,770 INFO L93 Difference]: Finished difference Result 180 states and 234 transitions. [2024-11-09 07:15:53,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:15:53,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 16 [2024-11-09 07:15:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:53,772 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:15:53,772 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 07:15:53,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:15:53,773 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 91 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:53,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 267 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 07:15:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 07:15:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2024-11-09 07:15:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 121 states have (on average 1.7603305785123966) internal successors, (213), 149 states have internal predecessors, (213), 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) [2024-11-09 07:15:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 213 transitions. [2024-11-09 07:15:53,780 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 213 transitions. Word has length 16 [2024-11-09 07:15:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 213 transitions. [2024-11-09 07:15:53,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-09 07:15:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 213 transitions. [2024-11-09 07:15:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:15:53,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:53,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:53,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 07:15:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:53,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 948000837, now seen corresponding path program 1 times [2024-11-09 07:15:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667382902] [2024-11-09 07:15:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:53,983 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 [2024-11-09 07:15:53,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:53,985 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:53,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:54,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:15:54,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:54,139 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 [2024-11-09 07:15:54,626 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 15 treesize of output 7 [2024-11-09 07:15:54,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:15:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:54,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:54,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667382902] [2024-11-09 07:15:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667382902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:54,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:15:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055463195] [2024-11-09 07:15:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:54,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:15:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:15:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:15:54,737 INFO L87 Difference]: Start difference. First operand 150 states and 213 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-09 07:15:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:56,368 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2024-11-09 07:15:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:15:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 16 [2024-11-09 07:15:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:56,370 INFO L225 Difference]: With dead ends: 143 [2024-11-09 07:15:56,370 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:15:56,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:15:56,371 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:56,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 327 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 07:15:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:15:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2024-11-09 07:15:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 130 states have internal predecessors, (172), 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) [2024-11-09 07:15:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2024-11-09 07:15:56,375 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 16 [2024-11-09 07:15:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2024-11-09 07:15:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-09 07:15:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2024-11-09 07:15:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:15:56,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:56,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:56,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:56,578 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1545403421, now seen corresponding path program 1 times [2024-11-09 07:15:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426856028] [2024-11-09 07:15:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:56,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:56,579 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:56,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:56,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:15:56,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:56,955 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 [2024-11-09 07:15:56,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:15:57,074 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:15:57,075 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 [2024-11-09 07:15:57,122 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 18 treesize of output 13 [2024-11-09 07:15:57,147 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 18 treesize of output 13 [2024-11-09 07:15:57,200 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 19 treesize of output 7 [2024-11-09 07:15:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:57,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:57,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426856028] [2024-11-09 07:15:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426856028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:57,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:15:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396040333] [2024-11-09 07:15:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:15:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:57,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:15:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:15:57,254 INFO L87 Difference]: Start difference. First operand 131 states and 172 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:58,263 INFO L93 Difference]: Finished difference Result 141 states and 183 transitions. [2024-11-09 07:15:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:15:58,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:15:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:58,265 INFO L225 Difference]: With dead ends: 141 [2024-11-09 07:15:58,265 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 07:15:58,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:15:58,266 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 34 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 321 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:15:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 07:15:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 07:15:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.6339285714285714) internal successors, (183), 140 states have internal predecessors, (183), 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) [2024-11-09 07:15:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2024-11-09 07:15:58,272 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 17 [2024-11-09 07:15:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:58,272 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2024-11-09 07:15:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:15:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2024-11-09 07:15:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:15:58,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:58,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:58,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:58,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:58,474 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:15:58,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:58,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1545403422, now seen corresponding path program 1 times [2024-11-09 07:15:58,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:15:58,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298813341] [2024-11-09 07:15:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:58,476 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 [2024-11-09 07:15:58,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:15:58,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:15:58,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:15:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:58,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:15:58,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:58,751 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 [2024-11-09 07:15:58,760 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 [2024-11-09 07:15:58,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:15:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:15:58,963 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:15:58,963 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 [2024-11-09 07:15:58,978 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 [2024-11-09 07:15:59,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:15:59,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:15:59,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:15:59,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:15:59,226 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 15 treesize of output 7 [2024-11-09 07:15:59,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:15:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:59,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:59,328 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:15:59,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298813341] [2024-11-09 07:15:59,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298813341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:59,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:59,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:15:59,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517165767] [2024-11-09 07:15:59,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:59,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:15:59,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:15:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:15:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:15:59,330 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:16:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:00,523 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2024-11-09 07:16:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:16:00,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:16:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:00,525 INFO L225 Difference]: With dead ends: 141 [2024-11-09 07:16:00,525 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 07:16:00,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:16:00,526 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 33 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:00,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 295 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:16:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 07:16:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-09 07:16:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 112 states have (on average 1.625) internal successors, (182), 140 states have internal predecessors, (182), 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) [2024-11-09 07:16:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 182 transitions. [2024-11-09 07:16:00,531 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 182 transitions. Word has length 17 [2024-11-09 07:16:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:00,531 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 182 transitions. [2024-11-09 07:16:00,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:16:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 182 transitions. [2024-11-09 07:16:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:16:00,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:00,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:00,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-09 07:16:00,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:00,733 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:00,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -336533360, now seen corresponding path program 1 times [2024-11-09 07:16:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291137293] [2024-11-09 07:16:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:00,734 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 [2024-11-09 07:16:00,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:00,735 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:00,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:16:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:00,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:16:00,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:01,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:16:01,159 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291137293] [2024-11-09 07:16:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291137293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:16:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:16:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:16:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126180168] [2024-11-09 07:16:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:16:01,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:16:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:16:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:16:01,160 INFO L87 Difference]: Start difference. First operand 141 states and 182 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 07:16:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:01,409 INFO L93 Difference]: Finished difference Result 140 states and 180 transitions. [2024-11-09 07:16:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:16:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-11-09 07:16:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:01,411 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:16:01,411 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:16:01,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:16:01,412 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 120 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:01,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 266 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:16:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:16:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 07:16:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.6071428571428572) internal successors, (180), 139 states have internal predecessors, (180), 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) [2024-11-09 07:16:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 180 transitions. [2024-11-09 07:16:01,420 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 180 transitions. Word has length 20 [2024-11-09 07:16:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:01,421 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 180 transitions. [2024-11-09 07:16:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 07:16:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 180 transitions. [2024-11-09 07:16:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:16:01,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:01,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:01,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:01,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:01,623 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:01,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -336573015, now seen corresponding path program 1 times [2024-11-09 07:16:01,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804124243] [2024-11-09 07:16:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:01,624 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 [2024-11-09 07:16:01,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:01,627 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:01,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:16:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:01,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:16:01,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:02,198 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 15 treesize of output 7 [2024-11-09 07:16:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:16:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:02,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:16:02,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804124243] [2024-11-09 07:16:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804124243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:16:02,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:16:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:16:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572857243] [2024-11-09 07:16:02,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:16:02,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:16:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:16:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:16:02,344 INFO L87 Difference]: Start difference. First operand 140 states and 180 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) [2024-11-09 07:16:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:03,701 INFO L93 Difference]: Finished difference Result 135 states and 162 transitions. [2024-11-09 07:16:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:16:03,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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 20 [2024-11-09 07:16:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:03,703 INFO L225 Difference]: With dead ends: 135 [2024-11-09 07:16:03,703 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 07:16:03,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:16:03,704 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 34 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:03,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 518 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:16:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 07:16:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2024-11-09 07:16:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 128 states have internal predecessors, (155), 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) [2024-11-09 07:16:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 155 transitions. [2024-11-09 07:16:03,709 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 155 transitions. Word has length 20 [2024-11-09 07:16:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:03,709 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 155 transitions. [2024-11-09 07:16:03,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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) [2024-11-09 07:16:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 155 transitions. [2024-11-09 07:16:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:16:03,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:03,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:03,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:16:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:03,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1211488033, now seen corresponding path program 1 times [2024-11-09 07:16:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456428414] [2024-11-09 07:16:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:03,915 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 [2024-11-09 07:16:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:03,916 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:03,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 07:16:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:04,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:16:04,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:04,271 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~head#1.base_15| (_ BitVec 64))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_15| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~head#1.base_15|) (_ bv0 1)))) is different from true [2024-11-09 07:16:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:04,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:16:04,282 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456428414] [2024-11-09 07:16:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456428414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:16:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:16:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:16:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879371756] [2024-11-09 07:16:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:16:04,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:16:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:16:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-09 07:16:04,283 INFO L87 Difference]: Start difference. First operand 129 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-09 07:16:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:05,110 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2024-11-09 07:16:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:16:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2024-11-09 07:16:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:05,111 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:16:05,111 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:16:05,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2024-11-09 07:16:05,112 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:05,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 106 Unchecked, 0.8s Time] [2024-11-09 07:16:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:16:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:16:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.576086956521739) internal successors, (145), 119 states have internal predecessors, (145), 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) [2024-11-09 07:16:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-09 07:16:05,117 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 23 [2024-11-09 07:16:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:05,117 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-09 07:16:05,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-09 07:16:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-09 07:16:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:16:05,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:05,118 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:05,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:05,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:05,319 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 760078044, now seen corresponding path program 1 times [2024-11-09 07:16:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481003446] [2024-11-09 07:16:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:05,320 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 [2024-11-09 07:16:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:05,321 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:05,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 07:16:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:05,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:16:05,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:05,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:16:05,821 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:05,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481003446] [2024-11-09 07:16:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481003446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:16:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:16:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:16:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066775805] [2024-11-09 07:16:05,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:16:05,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:16:05,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:16:05,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:16:05,824 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2024-11-09 07:16:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:06,458 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2024-11-09 07:16:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:16:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2024-11-09 07:16:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:06,461 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:16:06,461 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:16:06,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:16:06,462 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:06,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 207 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:16:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:16:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 07:16:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.565217391304348) internal successors, (144), 118 states have internal predecessors, (144), 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) [2024-11-09 07:16:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2024-11-09 07:16:06,467 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 24 [2024-11-09 07:16:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:06,467 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2024-11-09 07:16:06,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2024-11-09 07:16:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2024-11-09 07:16:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:16:06,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:06,468 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:06,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:06,669 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 55391246, now seen corresponding path program 1 times [2024-11-09 07:16:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638133231] [2024-11-09 07:16:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:06,670 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 [2024-11-09 07:16:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:06,674 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:06,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 07:16:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:06,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:16:06,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:07,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:16:07,187 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:07,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638133231] [2024-11-09 07:16:07,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638133231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:16:07,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:16:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:16:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584734655] [2024-11-09 07:16:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:16:07,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:16:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:07,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:16:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:16:07,189 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-11-09 07:16:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:08,143 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2024-11-09 07:16:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:16:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2024-11-09 07:16:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:08,145 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:16:08,145 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:16:08,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:16:08,145 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:08,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 241 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:16:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:16:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 07:16:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.5274725274725274) internal successors, (139), 115 states have internal predecessors, (139), 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) [2024-11-09 07:16:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2024-11-09 07:16:08,149 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 28 [2024-11-09 07:16:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2024-11-09 07:16:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-11-09 07:16:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2024-11-09 07:16:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:16:08,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:08,150 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:08,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:08,352 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1716731469, now seen corresponding path program 1 times [2024-11-09 07:16:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180638655] [2024-11-09 07:16:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:16:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:08,354 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:08,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 07:16:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:08,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:16:08,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:08,745 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 [2024-11-09 07:16:08,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:16:08,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:16:08,890 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:16:08,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:16:08,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:16:08,989 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 18 treesize of output 13 [2024-11-09 07:16:09,040 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 18 treesize of output 13 [2024-11-09 07:16:09,067 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 18 treesize of output 13 [2024-11-09 07:16:09,233 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 19 treesize of output 7 [2024-11-09 07:16:09,245 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 19 treesize of output 7 [2024-11-09 07:16:09,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:16:09,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:16:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:09,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:10,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 07:16:11,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~ptr~0#1.base|)))) (.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (or (forall ((v_arrayElimCell_42 (_ BitVec 64))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| v_arrayElimCell_42)))) (and (forall ((v_ArrVal_864 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_863 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_863) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) .cse1)) (or (forall ((v_ArrVal_864 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) .cse1 (forall ((v_ArrVal_863 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_863) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-11-09 07:16:14,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:14,351 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 22 treesize of output 23 [2024-11-09 07:16:14,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:14,380 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 7 treesize of output 3 [2024-11-09 07:16:14,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:14,397 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 22 treesize of output 23 [2024-11-09 07:16:14,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:16,715 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180638655] [2024-11-09 07:16:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180638655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [692402193] [2024-11-09 07:16:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:16,715 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:16:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:16:16,721 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:16:16,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 07:16:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:17,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:16:17,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:17,889 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 [2024-11-09 07:16:17,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:17,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:18,149 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:16:18,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:16:18,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:18,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:18,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:18,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:18,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:19,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:16:19,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:16:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:19,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:19,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 07:16:27,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:27,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:16:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:27,606 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 7 treesize of output 3 [2024-11-09 07:16:27,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:27,633 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 22 treesize of output 23 [2024-11-09 07:16:27,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:27,651 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 7 treesize of output 3 [2024-11-09 07:16:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [692402193] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842526242] [2024-11-09 07:16:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:27,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:16:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:16:27,666 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:16:27,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 07:16:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:27,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:16:27,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:28,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:28,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:28,113 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:16:28,113 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 [2024-11-09 07:16:28,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:28,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:28,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:28,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:28,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:29,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:16:29,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:16:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:29,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:29,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-09 07:16:30,362 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-09 07:16:30,362 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 16 treesize of output 15 [2024-11-09 07:16:30,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_944 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_944) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) (forall ((v_ArrVal_943 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_943) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))))) is different from false [2024-11-09 07:16:37,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:37,676 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 22 treesize of output 23 [2024-11-09 07:16:37,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:37,692 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 7 treesize of output 3 [2024-11-09 07:16:37,706 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:16:37,707 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 22 treesize of output 1 [2024-11-09 07:16:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842526242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:37,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 07:16:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 14, 14] total 45 [2024-11-09 07:16:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731920355] [2024-11-09 07:16:37,714 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 07:16:37,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 07:16:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:16:37,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 07:16:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1660, Unknown=41, NotChecked=170, Total=2070 [2024-11-09 07:16:37,716 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 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) [2024-11-09 07:16:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:44,756 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2024-11-09 07:16:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:16:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 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 29 [2024-11-09 07:16:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:44,767 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:16:44,767 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:16:44,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=323, Invalid=2400, Unknown=41, NotChecked=206, Total=2970 [2024-11-09 07:16:44,769 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:44,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1032 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1211 Invalid, 0 Unknown, 155 Unchecked, 5.6s Time] [2024-11-09 07:16:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:16:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-09 07:16:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 127 states have internal predecessors, (155), 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) [2024-11-09 07:16:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2024-11-09 07:16:44,782 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 29 [2024-11-09 07:16:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:44,782 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2024-11-09 07:16:44,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 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) [2024-11-09 07:16:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2024-11-09 07:16:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:16:44,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:44,784 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:16:44,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-09 07:16:44,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:45,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 07:16:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:16:45,385 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:16:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1716731470, now seen corresponding path program 1 times [2024-11-09 07:16:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:16:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307451440] [2024-11-09 07:16:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:45,386 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 [2024-11-09 07:16:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:16:45,388 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:16:45,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 07:16:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:45,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:16:45,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:45,784 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 [2024-11-09 07:16:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:16:45,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:16:45,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:16:45,968 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 [2024-11-09 07:16:45,984 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 [2024-11-09 07:16:46,057 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 18 treesize of output 13 [2024-11-09 07:16:46,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:16:46,138 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 18 treesize of output 13 [2024-11-09 07:16:46,179 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 18 treesize of output 13 [2024-11-09 07:16:46,354 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 19 treesize of output 7 [2024-11-09 07:16:46,370 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 19 treesize of output 7 [2024-11-09 07:16:46,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:16:46,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:47,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:16:47,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 7 treesize of output 3 [2024-11-09 07:16:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:47,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:48,542 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 60 treesize of output 56 [2024-11-09 07:16:48,548 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 90 treesize of output 82 [2024-11-09 07:16:48,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 07:16:51,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_34| (_ BitVec 64))) (or (forall ((v_ArrVal_1102 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_34| v_ArrVal_1102) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_34|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_34| (_ BitVec 64))) (or (forall ((v_ArrVal_1103 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_34| v_ArrVal_1103) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_34|) (_ bv0 1))))))) is different from false [2024-11-09 07:16:51,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:16:51,330 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 22 treesize of output 23 [2024-11-09 07:16:51,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:16:51,369 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:16:51,369 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 22 treesize of output 1 [2024-11-09 07:16:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:16:51,378 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:16:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307451440] [2024-11-09 07:16:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307451440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:51,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503297562] [2024-11-09 07:16:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:16:51,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:16:51,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:16:51,380 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:16:51,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 07:16:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:52,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:16:52,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:52,712 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 [2024-11-09 07:16:52,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:52,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:53,143 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 [2024-11-09 07:16:53,186 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:16:53,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:16:53,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:53,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:53,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:53,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:16:53,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:53,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:16:54,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:16:54,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:16:55,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:16:55,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:16:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:16:55,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:55,590 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 60 treesize of output 56 [2024-11-09 07:16:55,599 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 90 treesize of output 82 [2024-11-09 07:16:55,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 07:17:03,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:17:03,126 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 22 treesize of output 23 [2024-11-09 07:17:03,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:17:03,138 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 7 treesize of output 3 [2024-11-09 07:17:03,156 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:17:03,156 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 22 treesize of output 1 [2024-11-09 07:17:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1503297562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:17:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752529924] [2024-11-09 07:17:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:03,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:17:03,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:17:03,169 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:17:03,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 07:17:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:03,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:17:03,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:17:03,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:03,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:03,697 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:17:03,698 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 [2024-11-09 07:17:03,731 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 [2024-11-09 07:17:03,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:03,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:03,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:17:04,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:17:04,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:04,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:17:04,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 25 treesize of output 13 [2024-11-09 07:17:04,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:17:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:04,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:17:04,747 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 60 treesize of output 56 [2024-11-09 07:17:04,751 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 90 treesize of output 82 [2024-11-09 07:17:04,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 07:17:05,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_44| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_44|))) (forall ((v_ArrVal_1103 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_44| v_ArrVal_1103) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_44| (_ BitVec 64))) (or (forall ((v_ArrVal_1102 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_44| v_ArrVal_1102) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_create_~head~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_44|))))))) is different from false [2024-11-09 07:17:05,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:17:05,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:17:05,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-09 07:17:05,845 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 7 treesize of output 3 [2024-11-09 07:17:05,860 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:17:05,860 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 22 treesize of output 1 [2024-11-09 07:17:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:17:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752529924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:17:05,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 07:17:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 13, 13] total 35 [2024-11-09 07:17:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720322500] [2024-11-09 07:17:05,866 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 07:17:05,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:17:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:17:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:17:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1009, Unknown=13, NotChecked=130, Total=1260 [2024-11-09 07:17:05,868 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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) [2024-11-09 07:17:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:15,423 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2024-11-09 07:17:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:17:15,424 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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 29 [2024-11-09 07:17:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:15,425 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:17:15,425 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:17:15,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=205, Invalid=1682, Unknown=13, NotChecked=170, Total=2070 [2024-11-09 07:17:15,426 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 88 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:15,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 949 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 884 Invalid, 0 Unknown, 162 Unchecked, 7.5s Time] [2024-11-09 07:17:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:17:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-09 07:17:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 127 states have internal predecessors, (152), 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) [2024-11-09 07:17:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2024-11-09 07:17:15,432 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 29 [2024-11-09 07:17:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:15,432 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2024-11-09 07:17:15,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 36 states have internal predecessors, (90), 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) [2024-11-09 07:17:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2024-11-09 07:17:15,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:17:15,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:15,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:15,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 07:17:15,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 07:17:15,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-11-09 07:17:16,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:17:16,035 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:17:16,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1179624013, now seen corresponding path program 1 times [2024-11-09 07:17:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:17:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591354785] [2024-11-09 07:17:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:16,036 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 [2024-11-09 07:17:16,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:17:16,037 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:17:16,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-09 07:17:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:16,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:17:16,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:17:16,826 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 [2024-11-09 07:17:16,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:16,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:17,055 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:17:17,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:17:17,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:17,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:17,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:17,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:17,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:17:17,997 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 26 treesize of output 14 [2024-11-09 07:17:18,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:18,213 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:17:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-09 07:17:18,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 07:17:18,545 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 07:17:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:17:18,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 36 treesize of output 27 [2024-11-09 07:17:18,807 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 27 [2024-11-09 07:17:18,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:17:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:19,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:17:19,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-11-09 07:17:24,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1407 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1406 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1404))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1406))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47|))))) is different from false [2024-11-09 07:17:24,736 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1407 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1406 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1404))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1406))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:27,598 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1407 (_ BitVec 1)) (v_ArrVal_1400 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1399 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_49| (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1406 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_49| (_ bv1 1)))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_47|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (select (select (store (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_49| v_ArrVal_1399) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse4 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_49|)) |v_ULTIMATE.start_create_~ptr~0#1.base_49| v_ArrVal_1404)) (.cse2 (select .cse4 .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_49| v_ArrVal_1400) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) v_ArrVal_1406)))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_49|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_create_~head~0#1.base|))))))) is different from false [2024-11-09 07:17:28,218 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:17:28,441 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:17:28,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1082 treesize of output 843 [2024-11-09 07:17:28,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:17:28,491 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 237 treesize of output 208 [2024-11-09 07:17:28,521 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 352 treesize of output 322 [2024-11-09 07:17:28,558 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 149 treesize of output 141 [2024-11-09 07:17:28,582 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 272 [2024-11-09 07:17:28,808 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:17:28,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 489 treesize of output 479 [2024-11-09 07:17:28,837 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 249 treesize of output 213 [2024-11-09 07:17:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 07:17:33,280 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:17:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591354785] [2024-11-09 07:17:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591354785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:17:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1062830941] [2024-11-09 07:17:33,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:17:33,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:17:33,285 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:17:33,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 07:17:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:35,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 07:17:35,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:17:35,880 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 [2024-11-09 07:17:35,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:35,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:36,095 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:17:36,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:17:36,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:36,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:36,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:36,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:36,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:17:36,672 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 26 treesize of output 14 [2024-11-09 07:17:36,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:36,866 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:17:36,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-09 07:17:36,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 07:17:37,125 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 07:17:37,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:17:37,174 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 27 [2024-11-09 07:17:37,273 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 27 [2024-11-09 07:17:37,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:17:37,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:37,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:17:37,626 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1546) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (_ bv1 1)))) is different from false [2024-11-09 07:17:37,684 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_52| (_ BitVec 64)) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1544 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1544) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1546) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:42,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_52| (_ BitVec 64)) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1543 (_ BitVec 64)) (v_ArrVal_1544 (_ BitVec 1)) (v_ArrVal_1541 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1544) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1541))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1543))) |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1546) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:42,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_52| (_ BitVec 64)) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1543 (_ BitVec 64)) (v_ArrVal_1544 (_ BitVec 1)) (v_ArrVal_1541 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1544) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1541))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1543))) |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1546) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:42,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_52| (_ BitVec 64)) (v_ArrVal_1546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1543 (_ BitVec 64)) (v_ArrVal_1544 (_ BitVec 1)) (v_ArrVal_1541 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1544) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1541))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1543))) |v_ULTIMATE.start_create_~ptr~0#1.base_52| v_ArrVal_1546) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:44,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1536 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1537 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1407 (_ BitVec 1)) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_54| (_ BitVec 64)) (v_ArrVal_1406 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_54| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_54|))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse0 |c_ULTIMATE.start_create_~head~0#1.base|)))) (= (_ bv0 1) (bvadd (select (store .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (let ((.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (select (select (store (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_54| v_ArrVal_1537) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse4 .cse3 |v_ULTIMATE.start_create_~ptr~0#1.base_54|)) |v_ULTIMATE.start_create_~ptr~0#1.base_54| v_ArrVal_1404)) (.cse2 (select .cse4 .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_54| v_ArrVal_1536) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) v_ArrVal_1406)))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (_ bv1 1))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_create_~ptr~0#1.base_47|)))))) is different from false [2024-11-09 07:17:45,124 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:17:45,363 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:17:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3408 treesize of output 2707 [2024-11-09 07:17:45,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:17:45,414 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 360 treesize of output 330 [2024-11-09 07:17:45,439 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 474 treesize of output 444 [2024-11-09 07:17:45,621 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:17:45,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 493 treesize of output 483 [2024-11-09 07:17:45,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 172 [2024-11-09 07:17:45,670 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 196 treesize of output 184 [2024-11-09 07:17:45,682 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 249 treesize of output 213 [2024-11-09 07:17:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-09 07:17:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1062830941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:17:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666224156] [2024-11-09 07:17:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:17:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:17:52,623 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:17:52,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 07:17:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:52,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:17:52,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:17:53,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:53,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:17:53,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:17:53,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:17:53,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:53,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:53,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:53,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:53,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:17:54,172 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 26 treesize of output 14 [2024-11-09 07:17:54,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:17:54,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:17:54,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-09 07:17:54,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 07:17:54,573 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-09 07:17:54,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-09 07:17:54,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-11-09 07:17:54,723 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 27 [2024-11-09 07:17:54,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:17:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:54,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:17:54,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1681 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1681) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))))) is different from false [2024-11-09 07:17:59,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (_ BitVec 1)) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1678 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1676))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1678))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:17:59,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (_ BitVec 1)) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1678 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|) |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1676))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1678))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)))) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47|))))) is different from false [2024-11-09 07:17:59,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (_ BitVec 1)) (v_ArrVal_1676 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_47| (_ BitVec 64)) (v_ArrVal_1678 (_ BitVec 64)) (v_ArrVal_1409 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1407) (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|) |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1676))) (store .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse0 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1678))) |v_ULTIMATE.start_create_~ptr~0#1.base_47| v_ArrVal_1409) |c_ULTIMATE.start_create_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))))))) is different from false [2024-11-09 07:18:02,693 INFO L349 Elim1Store]: treesize reduction 118, result has 59.2 percent of original size [2024-11-09 07:18:02,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 358 [2024-11-09 07:18:12,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:13,014 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:18:13,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1827 treesize of output 1306 [2024-11-09 07:18:13,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:13,064 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 395 treesize of output 325 [2024-11-09 07:18:13,089 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 533 treesize of output 479 [2024-11-09 07:18:13,115 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 201 treesize of output 185 [2024-11-09 07:18:13,129 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 341 treesize of output 309 [2024-11-09 07:18:13,250 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:18:13,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 621 treesize of output 597 [2024-11-09 07:18:13,291 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 279 treesize of output 219 [2024-11-09 07:18:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 07:18:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666224156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:17,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 07:18:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14, 16, 16, 17] total 51 [2024-11-09 07:18:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523459378] [2024-11-09 07:18:17,723 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:18:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:18:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:18:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1150, Unknown=85, NotChecked=1190, Total=2652 [2024-11-09 07:18:17,726 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 52 states have internal predecessors, (112), 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) [2024-11-09 07:18:46,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:48,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:51,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:53,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:55,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:57,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:18:59,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:19:01,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:19:13,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:19:15,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-09 07:19:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:52,232 INFO L93 Difference]: Finished difference Result 154 states and 180 transitions. [2024-11-09 07:19:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:19:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 52 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:19:52,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:52,235 INFO L225 Difference]: With dead ends: 154 [2024-11-09 07:19:52,235 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 07:19:52,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 121 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 92.9s TimeCoverageRelationStatistics Valid=516, Invalid=2381, Unknown=129, NotChecked=1666, Total=4692 [2024-11-09 07:19:52,236 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 146 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 19 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 2264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 1272 IncrementalHoareTripleChecker+Unchecked, 45.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:52,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1377 Invalid, 2264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 914 Invalid, 59 Unknown, 1272 Unchecked, 45.4s Time] [2024-11-09 07:19:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 07:19:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2024-11-09 07:19:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 151 states have internal predecessors, (179), 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) [2024-11-09 07:19:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2024-11-09 07:19:52,241 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 31 [2024-11-09 07:19:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2024-11-09 07:19:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.196078431372549) internal successors, (112), 52 states have internal predecessors, (112), 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) [2024-11-09 07:19:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2024-11-09 07:19:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:19:52,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:52,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:52,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-09 07:19:52,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:52,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:52,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:52,847 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-11-09 07:19:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1179624012, now seen corresponding path program 1 times [2024-11-09 07:19:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:19:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769197105] [2024-11-09 07:19:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:52,848 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 [2024-11-09 07:19:52,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:19:52,852 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 07:19:52,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-09 07:19:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:53,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:19:53,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:53,623 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 [2024-11-09 07:19:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:19:53,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:19:53,951 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:19:53,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:19:53,992 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 [2024-11-09 07:19:54,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:54,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:54,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:55,395 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 26 treesize of output 14 [2024-11-09 07:19:55,428 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 19 treesize of output 11 [2024-11-09 07:19:55,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:55,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:55,814 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:19:55,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 61 treesize of output 54 [2024-11-09 07:19:55,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:19:56,036 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 11 [2024-11-09 07:19:56,063 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 44 treesize of output 24 [2024-11-09 07:19:56,478 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:19:56,479 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 07:19:56,603 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 07:19:56,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:19:56,771 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 34 treesize of output 25 [2024-11-09 07:19:56,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:56,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:19:56,949 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 34 treesize of output 25 [2024-11-09 07:19:57,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 25 treesize of output 13 [2024-11-09 07:19:57,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:19:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:57,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:58,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) is different from false [2024-11-09 07:20:07,501 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse2 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse0 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) .cse4 |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1817))) (store .cse3 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse3 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (let ((.cse6 (store .cse1 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse6 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse6 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv8 64) .cse5)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|)))))))) is different from false [2024-11-09 07:20:08,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv8 64) |c_ULTIMATE.start_list_add_tail_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_tail_~head#1.base|) .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.offset|))) (.cse3 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (let ((.cse1 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1818))) (store .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse1 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))) (bvule .cse0 (bvadd .cse0 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1818))) (store .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse4 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_tail_~head#1.base|) .cse6 |c_ULTIMATE.start_list_add_tail_~new#1.base|)) |c_ULTIMATE.start_list_add_tail_~new#1.base| v_ArrVal_1817))) (store .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base| (store (select .cse5 |c_ULTIMATE.start_list_add_tail_#t~mem3#1.base|) |c_ULTIMATE.start_list_add_tail_#t~mem3#1.offset| v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse3))))))))) is different from false [2024-11-09 07:20:26,805 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 1065 treesize of output 987 [2024-11-09 07:21:16,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:16,789 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:21:16,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1932 treesize of output 1531 [2024-11-09 07:21:17,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:17,081 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 472 treesize of output 452 [2024-11-09 07:21:17,128 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 151 treesize of output 135 [2024-11-09 07:21:17,158 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 251 treesize of output 219 [2024-11-09 07:21:17,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:17,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 226 [2024-11-09 07:21:17,242 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 352 treesize of output 292 [2024-11-09 07:21:17,275 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 175 treesize of output 139 [2024-11-09 07:21:17,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:18,644 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:21:18,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1160 treesize of output 1055 [2024-11-09 07:21:18,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:19,093 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:21:19,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3207 treesize of output 2292 [2024-11-09 07:21:19,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:19,274 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 629 treesize of output 613 [2024-11-09 07:21:19,327 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 261 treesize of output 245 [2024-11-09 07:21:19,629 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:21:19,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 700 treesize of output 672 [2024-11-09 07:21:19,695 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 326 treesize of output 254 [2024-11-09 07:21:19,750 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 98 treesize of output 86 [2024-11-09 07:21:19,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2024-11-09 07:21:20,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:21,079 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:21:21,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 3420 treesize of output 2575 [2024-11-09 07:21:21,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:21,579 INFO L349 Elim1Store]: treesize reduction 33, result has 63.7 percent of original size [2024-11-09 07:21:21,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1918 treesize of output 1611 [2024-11-09 07:21:21,894 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:21:21,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 903 treesize of output 873 [2024-11-09 07:21:22,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:22,096 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 529 treesize of output 517 [2024-11-09 07:21:22,160 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 368 treesize of output 296 [2024-11-09 07:21:22,204 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 213 treesize of output 193 [2024-11-09 07:21:22,282 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 124 treesize of output 112 [2024-11-09 07:21:22,358 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 100 treesize of output 88 [2024-11-09 07:21:22,895 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:23,318 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:21:23,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1118 treesize of output 1023 [2024-11-09 07:21:23,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:23,475 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 352 treesize of output 344 [2024-11-09 07:21:23,509 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 136 treesize of output 124 [2024-11-09 07:21:23,542 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 235 treesize of output 219 [2024-11-09 07:21:23,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:23,586 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 306 treesize of output 226 [2024-11-09 07:21:23,622 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 352 treesize of output 292 [2024-11-09 07:21:23,654 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 175 treesize of output 139 [2024-11-09 07:21:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:21:29,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:21:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769197105] [2024-11-09 07:21:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769197105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:21:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681593119] [2024-11-09 07:21:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:21:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 07:21:29,029 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:21:29,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 07:21:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:32,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-09 07:21:33,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:33,025 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 [2024-11-09 07:21:33,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:21:33,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:21:33,465 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 [2024-11-09 07:21:33,705 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:21:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:21:33,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:33,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:34,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:34,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:35,206 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 26 treesize of output 14 [2024-11-09 07:21:35,405 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 19 treesize of output 11 [2024-11-09 07:21:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:35,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:35,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:21:35,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-09 07:21:35,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:21:36,070 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 11 [2024-11-09 07:21:36,119 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 44 treesize of output 24 [2024-11-09 07:21:36,667 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:21:36,667 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 07:21:36,896 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 07:21:36,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:21:36,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 07:21:37,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:37,260 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 34 treesize of output 25 [2024-11-09 07:21:37,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:21:40,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:21:40,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:21:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:43,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:21:44,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1974) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv8 64) .cse1)))))) is different from false [2024-11-09 07:22:50,853 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 2155 treesize of output 1999 [2024-11-09 07:23:48,172 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:48,945 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:23:48,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 930 treesize of output 875 [2024-11-09 07:23:49,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:49,198 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 352 treesize of output 344 [2024-11-09 07:23:49,257 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 136 treesize of output 124 [2024-11-09 07:23:49,304 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 235 treesize of output 219 [2024-11-09 07:23:49,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:49,384 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 336 treesize of output 246 [2024-11-09 07:23:49,425 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 394 treesize of output 328 [2024-11-09 07:23:49,473 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 171 [2024-11-09 07:23:50,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:51,223 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:23:51,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1236 treesize of output 1039 [2024-11-09 07:23:51,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:51,503 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 472 treesize of output 452 [2024-11-09 07:23:51,565 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 151 treesize of output 135 [2024-11-09 07:23:51,613 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 251 treesize of output 219 [2024-11-09 07:23:51,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:51,696 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 336 treesize of output 246 [2024-11-09 07:23:51,735 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 394 treesize of output 328 [2024-11-09 07:23:51,789 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 171 [2024-11-09 07:23:53,151 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:23:53,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 2949 treesize of output 2538 [2024-11-09 07:23:53,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:23:54,151 INFO L349 Elim1Store]: treesize reduction 33, result has 63.7 percent of original size [2024-11-09 07:23:54,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1553 treesize of output 1326 [2024-11-09 07:23:54,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:23:54,429 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 697 treesize of output 681 [2024-11-09 07:23:54,523 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 329 treesize of output 313 [2024-11-09 07:23:54,615 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 310 treesize of output 294 [2024-11-09 07:23:54,680 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 294 treesize of output 262 [2024-11-09 07:23:55,188 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:23:55,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 845 treesize of output 815 [2024-11-09 07:23:55,284 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 430 treesize of output 354 [2024-11-09 07:23:55,421 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 100 treesize of output 88 [2024-11-09 07:24:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 07:24:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1681593119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:24:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401603757] [2024-11-09 07:24:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:01,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:24:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:24:01,509 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:24:01,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a4e6d4f-1241-46c2-bed5-4b0302464b63/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 07:24:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:01,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:24:01,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:24:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:24:07,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:24:08,076 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 [2024-11-09 07:24:08,500 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:24:08,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:24:08,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:08,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:09,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:09,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:11,068 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 19 treesize of output 11 [2024-11-09 07:24:11,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 26 treesize of output 14 [2024-11-09 07:24:11,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:11,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:12,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:24:12,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-09 07:24:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:24:12,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2024-11-09 07:24:12,587 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 11 [2024-11-09 07:24:13,609 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 07:24:13,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:24:13,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:24:13,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:13,996 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 34 treesize of output 25 [2024-11-09 07:24:14,391 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 34 treesize of output 25 [2024-11-09 07:24:14,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:24:14,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:24:14,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:24:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:24:19,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:25:38,320 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 1065 treesize of output 987 [2024-11-09 07:27:19,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:21,175 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:27:21,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1282 treesize of output 1177 [2024-11-09 07:27:21,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:22,174 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:27:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1226 treesize of output 897 [2024-11-09 07:27:22,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:22,465 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 658 treesize of output 642 [2024-11-09 07:27:22,531 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 294 treesize of output 278 [2024-11-09 07:27:22,618 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 207 treesize of output 191 [2024-11-09 07:27:23,182 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:27:23,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 734 treesize of output 706 [2024-11-09 07:27:23,272 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 349 treesize of output 277 [2024-11-09 07:27:23,364 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 100 treesize of output 88 [2024-11-09 07:27:24,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:24,964 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:27:24,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1226 treesize of output 1131 [2024-11-09 07:27:25,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:25,233 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 352 treesize of output 344 [2024-11-09 07:27:25,292 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 136 treesize of output 124 [2024-11-09 07:27:25,341 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 235 treesize of output 219 [2024-11-09 07:27:25,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:25,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 226 [2024-11-09 07:27:25,503 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 352 treesize of output 292 [2024-11-09 07:27:25,555 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 175 treesize of output 139 [2024-11-09 07:27:26,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:26,947 INFO L349 Elim1Store]: treesize reduction 53, result has 62.4 percent of original size [2024-11-09 07:27:26,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3664 treesize of output 2775 [2024-11-09 07:27:27,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:27,324 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 580 treesize of output 560 [2024-11-09 07:27:27,379 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 260 treesize of output 244 [2024-11-09 07:27:27,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:27,474 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 325 treesize of output 245 [2024-11-09 07:27:27,522 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 191 treesize of output 159 [2024-11-09 07:27:27,602 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 352 treesize of output 292 [2024-11-09 07:27:27,656 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 175 treesize of output 139 [2024-11-09 07:27:28,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:29,355 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2024-11-09 07:27:29,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1037 treesize of output 778 [2024-11-09 07:27:29,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:27:30,383 INFO L349 Elim1Store]: treesize reduction 33, result has 63.7 percent of original size [2024-11-09 07:27:30,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2657 treesize of output 2186 [2024-11-09 07:27:30,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:27:30,665 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 629 treesize of output 613 [2024-11-09 07:27:31,258 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 07:27:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 727 treesize of output 699 [2024-11-09 07:27:31,339 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 193 treesize of output 177 [2024-11-09 07:27:31,432 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 124 treesize of output 112 [2024-11-09 07:27:31,475 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 330 treesize of output 258 [2024-11-09 07:27:31,571 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 98 treesize of output 86 [2024-11-09 07:27:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:27:35,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401603757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:27:35,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 07:27:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15, 16, 16, 16] total 46 [2024-11-09 07:27:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213915629] [2024-11-09 07:27:35,609 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 07:27:35,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 07:27:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:27:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 07:27:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1503, Unknown=120, NotChecked=340, Total=2162 [2024-11-09 07:27:35,612 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand has 47 states, 46 states have (on average 2.217391304347826) internal successors, (102), 47 states have internal predecessors, (102), 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) [2024-11-09 07:27:37,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatRoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:40,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatRoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:41,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatRoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:46,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:48,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:54,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:27:56,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:18,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:20,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:22,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:24,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:27,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:29,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:28:58,242 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (let ((.cse19 (select .cse16 .cse1)) (.cse11 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~next#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse7 (select .cse6 (_ bv8 64))) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base|)) (.cse12 (bvadd (_ bv8 64) |c_ULTIMATE.start___list_add_~prev#1.offset|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~next#1.base|) .cse11 |c_ULTIMATE.start___list_add_~new#1.offset|))) (.cse5 (bvadd .cse19 (_ bv8 64)))) (and (not (= |c_ULTIMATE.start___list_add_~new#1.base| |c_ULTIMATE.start_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base| (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822)) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1821)) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (= (_ bv24 64) (select |c_#length| |c_ULTIMATE.start___list_add_~new#1.base|)) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~next#1.offset|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv8 64) .cse2)))))) (= |c_ULTIMATE.start_create_~head~0#1.base| |c_ULTIMATE.start___list_add_~next#1.base|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse4 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse4 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv8 64) .cse3)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))) (bvule .cse5 (select |c_#length| (select .cse6 .cse1))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (= .cse7 |c_ULTIMATE.start___list_add_~prev#1.base|) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse8 (store .cse9 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse8 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse8 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~next#1.base|) .cse11 |c_ULTIMATE.start___list_add_~new#1.base|)) |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1817))) (store .cse10 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse10 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (bvule .cse12 (select |c_#length| |c_ULTIMATE.start___list_add_~prev#1.base|)) (= (_ bv4 64) |c_ULTIMATE.start___list_add_~new#1.offset|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))) (= .cse7 |c_ULTIMATE.start_create_~head~0#1.base|) (= (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start___list_add_~new#1.base|)) (_ bv0 1)) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse13 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse13 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1817))) (store .cse14 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse14 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1822 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___list_add_~prev#1.base| (store .cse0 |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822)) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse15 (bvadd .cse15 (_ bv8 64))))))) (bvule |c_ULTIMATE.start___list_add_~prev#1.offset| .cse12) (= (_ bv0 64) (select .cse16 (_ bv8 64))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (select (select (store (let ((.cse18 (store .cse9 |c_ULTIMATE.start___list_add_~new#1.base| v_ArrVal_1818))) (store .cse18 |c_ULTIMATE.start___list_add_~prev#1.base| (store (select .cse18 |c_ULTIMATE.start___list_add_~prev#1.base|) |c_ULTIMATE.start___list_add_~prev#1.offset| v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse17 (bvadd (_ bv8 64) .cse17)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))) (bvule .cse19 .cse5) (= (_ bv0 64) |c_ULTIMATE.start___list_add_~prev#1.offset|))))) is different from true [2024-11-09 07:29:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:04,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:07,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:17,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:19,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:22,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:24,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:26,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:28,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:30,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:32,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:35,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:37,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:39,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:41,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:43,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:45,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:47,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:49,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:51,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:53,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:55,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:57,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:29:59,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:30:07,743 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse18 (bvadd (_ bv4 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|)) (.cse13 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|)))) (.cse50 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse10 (select .cse50 (_ bv8 64))) (.cse21 (not .cse13)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse50 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|))) (.cse2 (select .cse50 .cse1)) (.cse4 (select .cse12 .cse1)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse12 .cse1 .cse18)))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))) (or (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse2)))) (and (forall ((v_ArrVal_1965 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1967 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse3 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse3 .cse2 (store (select .cse3 .cse2) .cse4 v_ArrVal_1968))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse6 (store .cse7 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1965))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse4 v_ArrVal_1967))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (store (let ((.cse9 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse9 .cse2 (store (select .cse9 .cse2) .cse4 v_ArrVal_1968))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse8 (bvadd (_ bv8 64) .cse8)))))))) (forall ((v_ArrVal_1974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1974) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (= (bvadd (_ bv1 1) (select |c_#valid| .cse10)) (_ bv0 1)) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (= (_ bv24 64) (select |c_#length| .cse10)) (forall ((v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse11 (bvadd (_ bv8 64) .cse11)))) (= (_ bv4 64) (select .cse12 (_ bv8 64))) .cse13 (forall ((v_ArrVal_1957 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1957) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse15 (select .cse20 .cse1))) (or (forall ((v_ArrVal_1965 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1956 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1967 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1956) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse16 (select .cse17 .cse1))) (bvule (bvadd (select (select (store (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse17 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_1968))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse20 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1965))) (store .cse19 .cse15 (store (select .cse19 .cse15) .cse16 v_ArrVal_1967))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse15)))))))) (not (= .cse10 |c_ULTIMATE.start_create_~head~0#1.base|)) (not (= .cse10 |c_ULTIMATE.start_create_~ptr~0#1.base|)) (or .cse21 (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2102 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2101 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse22 (select (select (store (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse25 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818)) (.cse24 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2101) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (store .cse23 .cse24 (store (select .cse23 .cse24) (select .cse25 .cse1) v_ArrVal_1822)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse22 (bvadd (_ bv8 64) .cse22)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2102 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2101 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse29 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse31 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2101) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse27 (select .cse31 .cse1)) (.cse28 (select .cse29 .cse1))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse29 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse31 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1817))) (store .cse30 .cse27 (store (select .cse30 .cse27) .cse28 v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))))) (not (= |c_ULTIMATE.start_create_~head~0#1.base| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (or .cse21 (and (forall ((v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse35 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse37 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse33 (select .cse37 .cse1)) (.cse34 (select .cse35 .cse1))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse35 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse37 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1817))) (store .cse36 .cse33 (store (select .cse36 .cse33) .cse34 v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse38 (select (select (store (let ((.cse41 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse41 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818)) (.cse40 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (store .cse39 .cse40 (store (select .cse39 .cse40) (select .cse41 .cse1) v_ArrVal_1822)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse38 (bvadd (_ bv8 64) .cse38)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))))) (or .cse21 (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse42 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse42 .cse2 (store (select .cse42 .cse2) .cse4 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse43 (store .cse7 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1817))) (store .cse43 .cse2 (store (select .cse43 .cse2) .cse4 v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse44 (select (select (store (let ((.cse45 (store .cse5 |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse45 .cse2 (store (select .cse45 .cse2) .cse4 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse44 (bvadd (_ bv8 64) .cse44)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))))) (forall ((v_ArrVal_1957 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1957) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1956 (Array (_ BitVec 64) (_ BitVec 64)))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse46 (select (select (store (let ((.cse49 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1956) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse47 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse49 .cse1 .cse18)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse47 .cse48 (store (select .cse47 .cse48) (select .cse49 .cse1) v_ArrVal_1968)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse46 (bvadd .cse46 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse48)))))))))) is different from true [2024-11-09 07:30:11,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:30:13,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:30:17,518 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base|) (_ bv8 64))) (.cse11 (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_create_~head~0#1.base|))))) (.cse8 (bvadd (_ bv4 64) |c_ULTIMATE.start_create_~ptr~0#1.offset|)) (.cse1 (bvadd (_ bv8 64) |c_ULTIMATE.start_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv8 64) .cse0)))) (forall ((v_ArrVal_1974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1974) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv8 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))) (= (_ bv0 64) |c_ULTIMATE.start_create_~head~0#1.offset|) (= (_ bv24 64) (select |c_#length| .cse2)) (forall ((v_ArrVal_1973 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1973) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv8 64) .cse3)))) (= (_ bv4 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base|) (_ bv8 64))) (forall ((v_ArrVal_1957 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1957) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse5 (select .cse10 .cse1))) (or (forall ((v_ArrVal_1965 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1956 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1967 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1956) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse6 (select .cse7 .cse1))) (bvule (bvadd (select (select (store (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse7 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1968))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1) (_ bv8 64)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse9 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse10 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1965))) (store .cse9 .cse5 (store (select .cse9 .cse5) .cse6 v_ArrVal_1967))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse5)))))))) (not (= .cse2 |c_ULTIMATE.start_create_~head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_create_~ptr~0#1.base|)) (or .cse11 (and (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2102 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2101 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (store (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse15 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818)) (.cse14 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2101) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (store .cse13 .cse14 (store (select .cse13 .cse14) (select .cse15 .cse1) v_ArrVal_1822)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse12 (bvadd (_ bv8 64) .cse12)))))) (forall ((|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2102 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_2101 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse21 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_2101) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse17 (select .cse21 .cse1)) (.cse18 (select .cse19 .cse1))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse19 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse16 .cse17 (store (select .cse16 .cse17) .cse18 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse20 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse21 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1817))) (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))))) (not (= |c_ULTIMATE.start_create_~head~0#1.base| |c_ULTIMATE.start_create_~ptr~0#1.base|)) (or .cse11 (and (forall ((v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64)) (v_ArrVal_1821 (_ BitVec 64)) (v_ArrVal_1817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))) (forall ((v_ArrVal_1826 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1823 (_ BitVec 64)) (v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_create_~head~0#1.base|)) (.cse27 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse23 (select .cse27 .cse1)) (.cse24 (select .cse25 .cse1))) (bvule (bvadd (_ bv8 64) (select (select (store (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse25 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_ArrVal_1822))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1823) (select (select (store (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse27 .cse1 |c_ULTIMATE.start_create_~ptr~0#1.base|)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1817))) (store .cse26 .cse23 (store (select .cse26 .cse23) .cse24 v_ArrVal_1821))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1826) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1)))))))) (forall ((v_ArrVal_1810 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1809 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1822 (_ BitVec 64))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse28 (select (select (store (let ((.cse31 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse31 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1818)) (.cse30 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (store .cse29 .cse30 (store (select .cse29 .cse30) (select .cse31 .cse1) v_ArrVal_1822)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse28 (bvadd (_ bv8 64) .cse28)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))))) (forall ((v_ArrVal_1957 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse34 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1957) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1964 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1968 (_ BitVec 64)) (|v_ULTIMATE.start_create_~ptr~0#1.base_62| (_ BitVec 64)) (v_ArrVal_1956 (Array (_ BitVec 64) (_ BitVec 64)))) (or (forall ((v_ArrVal_1827 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse32 (select (select (store (let ((.cse35 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1956) |c_ULTIMATE.start_create_~head~0#1.base|))) (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~head~0#1.base| (store .cse35 .cse1 .cse8)) |c_ULTIMATE.start_create_~ptr~0#1.base| v_ArrVal_1964))) (store .cse33 .cse34 (store (select .cse33 .cse34) (select .cse35 .cse1) v_ArrVal_1968)))) |v_ULTIMATE.start_create_~ptr~0#1.base_62| v_ArrVal_1827) |c_ULTIMATE.start_create_~head~0#1.base|) .cse1))) (bvule .cse32 (bvadd .cse32 (_ bv8 64))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_create_~ptr~0#1.base_62|))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| .cse34))))))))) is different from true