./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/dirname-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:38:59,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:38:59,622 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-06 22:38:59,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:38:59,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:38:59,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:38:59,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:38:59,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:38:59,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:38:59,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:38:59,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:38:59,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:38:59,689 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:38:59,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:38:59,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:38:59,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:38:59,691 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:38:59,692 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:38:59,692 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:38:59,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:38:59,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:38:59,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:38:59,695 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:38:59,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:38:59,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:38:59,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:38:59,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:38:59,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:38:59,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:38:59,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:38:59,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:38:59,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:38:59,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:38:59,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:38:59,702 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:38:59,703 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/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_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-11-06 22:39:00,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:00,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:00,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:00,049 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:00,050 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:00,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-11-06 22:39:03,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:03,869 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:03,870 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-11-06 22:39:03,910 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/e9c5383d2/e16b7a5d4d124a68ab5811b7f60a012a/FLAGac23417a5 [2023-11-06 22:39:03,931 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/e9c5383d2/e16b7a5d4d124a68ab5811b7f60a012a [2023-11-06 22:39:03,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:03,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:03,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:03,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:03,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:03,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:03" (1/1) ... [2023-11-06 22:39:03,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7829ee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:03, skipping insertion in model container [2023-11-06 22:39:03,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:03" (1/1) ... [2023-11-06 22:39:04,062 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:04,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:04,971 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-06 22:39:04,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5624086d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:04, skipping insertion in model container [2023-11-06 22:39:04,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:04,973 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 22:39:04,975 INFO L158 Benchmark]: Toolchain (without parser) took 1037.46ms. Allocated memory is still 151.0MB. Free memory was 102.0MB in the beginning and 83.5MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:39:04,976 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:39:04,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1030.01ms. Allocated memory is still 151.0MB. Free memory was 101.7MB in the beginning and 83.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:39:04,979 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.25ms. Allocated memory is still 151.0MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1030.01ms. Allocated memory is still 151.0MB. Free memory was 101.7MB in the beginning and 83.5MB 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: 1162]: 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_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/dirname-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:07,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:07,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-06 22:39:07,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:07,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:08,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:08,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:08,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:08,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:08,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:08,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:08,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:08,016 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:08,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:08,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:08,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:08,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:39:08,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:39:08,020 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:39:08,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:08,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:08,022 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:39:08,023 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:39:08,023 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:39:08,024 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:08,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:08,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:08,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:08,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:08,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:08,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:08,028 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:39:08,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:39:08,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:08,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:08,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:08,030 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:39:08,030 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:08,030 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/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_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2023-11-06 22:39:08,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:08,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:08,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:08,591 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:08,592 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:08,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-11-06 22:39:11,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:12,306 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:12,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2023-11-06 22:39:12,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/41c5dcccb/335cb912227c4834896fb4755662f8fc/FLAG0f7916d87 [2023-11-06 22:39:12,349 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/data/41c5dcccb/335cb912227c4834896fb4755662f8fc [2023-11-06 22:39:12,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:12,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:12,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:12,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:12,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:12,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:12" (1/1) ... [2023-11-06 22:39:12,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e1d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:12, skipping insertion in model container [2023-11-06 22:39:12,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:12" (1/1) ... [2023-11-06 22:39:12,459 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:13,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:13,453 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:39:13,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:13,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:13,592 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:13,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:13,797 WARN L672 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:39:13,798 WARN L672 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:39:13,804 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:13,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13 WrapperNode [2023-11-06 22:39:13,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:13,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:13,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:13,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:13,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,895 INFO L138 Inliner]: procedures = 350, calls = 111, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 268 [2023-11-06 22:39:13,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:13,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:13,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:13,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:13,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:13,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:13,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:13,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:13,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (1/1) ... [2023-11-06 22:39:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:14,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:14,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:14,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:39:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:39:14,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:39:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:39:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:39:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:39:14,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:39:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2023-11-06 22:39:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:39:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-06 22:39:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:14,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:39:14,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:14,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:14,307 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:14,310 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:15,638 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:15,645 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:15,646 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-06 22:39:15,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:15 BoogieIcfgContainer [2023-11-06 22:39:15,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:15,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:15,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:15,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:15,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:12" (1/3) ... [2023-11-06 22:39:15,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268bd84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:15, skipping insertion in model container [2023-11-06 22:39:15,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:13" (2/3) ... [2023-11-06 22:39:15,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268bd84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:15, skipping insertion in model container [2023-11-06 22:39:15,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:15" (3/3) ... [2023-11-06 22:39:15,657 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2023-11-06 22:39:15,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:15,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-11-06 22:39:15,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:15,733 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e32ca09, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:15,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-11-06 22:39:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 107 states have (on average 1.9065420560747663) internal successors, (204), 180 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:39:15,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:15,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:39:15,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:15,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:39:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643532182] [2023-11-06 22:39:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:15,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:15,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:15,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:39:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:15,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:39:15,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:15,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 22:39:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:15,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:15,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:15,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643532182] [2023-11-06 22:39:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643532182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:15,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132356797] [2023-11-06 22:39:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:15,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:15,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:16,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:16,016 INFO L87 Difference]: Start difference. First operand has 183 states, 107 states have (on average 1.9065420560747663) internal successors, (204), 180 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) 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) [2023-11-06 22:39:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:16,566 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2023-11-06 22:39:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:16,568 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 [2023-11-06 22:39:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:16,579 INFO L225 Difference]: With dead ends: 194 [2023-11-06 22:39:16,580 INFO L226 Difference]: Without dead ends: 192 [2023-11-06 22:39:16,581 INFO L412 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 [2023-11-06 22:39:16,585 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 165 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:16,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 150 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:39:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-06 22:39:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 175. [2023-11-06 22:39:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 104 states have (on average 1.8076923076923077) internal successors, (188), 172 states have internal predecessors, (188), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2023-11-06 22:39:16,633 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 3 [2023-11-06 22:39:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:16,634 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2023-11-06 22:39:16,634 INFO L496 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) [2023-11-06 22:39:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2023-11-06 22:39:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:39:16,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:16,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:39:16,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Ended with exit code 0 [2023-11-06 22:39:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:16,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:16,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:39:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820084770] [2023-11-06 22:39:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:16,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 [2023-11-06 22:39:16,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:16,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:16,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:39:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:16,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:39:16,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:16,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:39:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:17,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:17,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820084770] [2023-11-06 22:39:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820084770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:17,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:17,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340125771] [2023-11-06 22:39:17,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:17,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:17,019 INFO L87 Difference]: Start difference. First operand 175 states and 190 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) [2023-11-06 22:39:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:17,774 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2023-11-06 22:39:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:17,774 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 [2023-11-06 22:39:17,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:17,777 INFO L225 Difference]: With dead ends: 174 [2023-11-06 22:39:17,777 INFO L226 Difference]: Without dead ends: 174 [2023-11-06 22:39:17,777 INFO L412 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 [2023-11-06 22:39:17,779 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:17,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 298 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:39:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-06 22:39:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-11-06 22:39:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 104 states have (on average 1.7980769230769231) internal successors, (187), 171 states have internal predecessors, (187), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2023-11-06 22:39:17,794 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 3 [2023-11-06 22:39:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:17,795 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2023-11-06 22:39:17,795 INFO L496 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) [2023-11-06 22:39:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2023-11-06 22:39:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:39:17,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:17,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:39:17,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:18,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:18,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:18,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-11-06 22:39:18,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:18,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42602750] [2023-11-06 22:39:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:18,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:18,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:18,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:18,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:39:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:18,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:39:18,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:18,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:39:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:18,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:18,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42602750] [2023-11-06 22:39:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42602750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:39:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598837659] [2023-11-06 22:39:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:18,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:39:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:39:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:18,264 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:19,299 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2023-11-06 22:39:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:39:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 22:39:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:19,302 INFO L225 Difference]: With dead ends: 178 [2023-11-06 22:39:19,303 INFO L226 Difference]: Without dead ends: 178 [2023-11-06 22:39:19,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:39:19,304 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 10 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:19,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 411 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:39:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-06 22:39:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2023-11-06 22:39:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.7830188679245282) internal successors, (189), 173 states have internal predecessors, (189), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2023-11-06 22:39:19,319 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 6 [2023-11-06 22:39:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:19,319 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2023-11-06 22:39:19,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2023-11-06 22:39:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:39:19,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:19,321 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:19,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:19,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:19,533 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:19,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-11-06 22:39:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106710276] [2023-11-06 22:39:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:19,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:19,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:19,536 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:19,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:39:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:19,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:39:19,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:19,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:39:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:19,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:20,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106710276] [2023-11-06 22:39:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106710276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:20,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:20,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-06 22:39:20,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659103035] [2023-11-06 22:39:20,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:20,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:39:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:39:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:39:20,669 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:24,630 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2023-11-06 22:39:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 22:39:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:24,633 INFO L225 Difference]: With dead ends: 182 [2023-11-06 22:39:24,634 INFO L226 Difference]: Without dead ends: 182 [2023-11-06 22:39:24,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:24,635 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 13 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:24,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 868 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-06 22:39:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-06 22:39:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-11-06 22:39:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 113 states have (on average 1.7256637168141593) internal successors, (195), 179 states have internal predecessors, (195), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2023-11-06 22:39:24,648 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 10 [2023-11-06 22:39:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:24,648 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2023-11-06 22:39:24,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:39:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2023-11-06 22:39:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:39:24,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:24,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:24,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:24,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:24,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:24,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -116905722, now seen corresponding path program 1 times [2023-11-06 22:39:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327696050] [2023-11-06 22:39:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:24,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:24,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:24,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:39:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:25,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:39:25,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:25,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:25,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:25,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327696050] [2023-11-06 22:39:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327696050] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:25,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 22:39:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920858821] [2023-11-06 22:39:25,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:25,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:39:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:39:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:25,263 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:39:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:25,590 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2023-11-06 22:39:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:39:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-11-06 22:39:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:25,593 INFO L225 Difference]: With dead ends: 202 [2023-11-06 22:39:25,593 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 22:39:25,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:39:25,595 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 18 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:25,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1103 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:39:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 22:39:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-11-06 22:39:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 133 states have (on average 1.6165413533834587) internal successors, (215), 199 states have internal predecessors, (215), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2023-11-06 22:39:25,608 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 25 [2023-11-06 22:39:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:25,609 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2023-11-06 22:39:25,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:39:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2023-11-06 22:39:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:39:25,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:25,611 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:25,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:25,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:25,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:25,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash 670975895, now seen corresponding path program 2 times [2023-11-06 22:39:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905987754] [2023-11-06 22:39:25,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:39:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:25,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:25,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:39:25,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:39:25,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:25,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:39:25,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:26,029 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:39:26,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 22:39:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:39:26,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:26,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905987754] [2023-11-06 22:39:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905987754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:26,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465821837] [2023-11-06 22:39:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:26,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:26,069 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:26,672 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2023-11-06 22:39:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-11-06 22:39:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:26,675 INFO L225 Difference]: With dead ends: 214 [2023-11-06 22:39:26,675 INFO L226 Difference]: Without dead ends: 214 [2023-11-06 22:39:26,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:26,676 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 150 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:26,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 153 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:39:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-06 22:39:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2023-11-06 22:39:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.5789473684210527) internal successors, (210), 194 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2023-11-06 22:39:26,686 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 45 [2023-11-06 22:39:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:26,687 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2023-11-06 22:39:26,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2023-11-06 22:39:26,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:39:26,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:26,689 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:26,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:26,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:26,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:26,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 670975896, now seen corresponding path program 1 times [2023-11-06 22:39:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662985783] [2023-11-06 22:39:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:26,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:26,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:39:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:27,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:39:27,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:27,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:27,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:27,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662985783] [2023-11-06 22:39:27,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662985783] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:27,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:39:27,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-06 22:39:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303320587] [2023-11-06 22:39:27,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:39:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:27,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:39:27,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:39:27,759 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:39:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:28,498 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2023-11-06 22:39:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:39:28,499 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-11-06 22:39:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:28,501 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:39:28,502 INFO L226 Difference]: Without dead ends: 205 [2023-11-06 22:39:28,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:39:28,503 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 6 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:28,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2365 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:39:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-06 22:39:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-11-06 22:39:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 141 states have (on average 1.5460992907801419) internal successors, (218), 202 states have internal predecessors, (218), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2023-11-06 22:39:28,514 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 45 [2023-11-06 22:39:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:28,517 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2023-11-06 22:39:28,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 22:39:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2023-11-06 22:39:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:39:28,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:28,523 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:28,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:39:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:28,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:28,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1502824878, now seen corresponding path program 2 times [2023-11-06 22:39:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545952595] [2023-11-06 22:39:28,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:39:28,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:28,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:28,743 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:28,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:39:28,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:39:28,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:28,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:39:28,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:29,044 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:39:29,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 22:39:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:29,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:29,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545952595] [2023-11-06 22:39:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545952595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:29,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:29,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:39:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005322788] [2023-11-06 22:39:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:29,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:39:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:39:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:39:29,138 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:30,782 INFO L93 Difference]: Finished difference Result 327 states and 355 transitions. [2023-11-06 22:39:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:30,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-11-06 22:39:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:30,786 INFO L225 Difference]: With dead ends: 327 [2023-11-06 22:39:30,786 INFO L226 Difference]: Without dead ends: 327 [2023-11-06 22:39:30,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:30,787 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 441 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:30,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 496 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:39:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-06 22:39:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 271. [2023-11-06 22:39:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 208 states have (on average 1.6442307692307692) internal successors, (342), 268 states have internal predecessors, (342), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 344 transitions. [2023-11-06 22:39:30,797 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 344 transitions. Word has length 53 [2023-11-06 22:39:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:30,798 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 344 transitions. [2023-11-06 22:39:30,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 344 transitions. [2023-11-06 22:39:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 22:39:30,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:30,800 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:30,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:31,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:31,009 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:31,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 83123473, now seen corresponding path program 1 times [2023-11-06 22:39:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068271249] [2023-11-06 22:39:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:31,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:31,011 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:31,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:39:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:31,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:39:31,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:31,540 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:39:31,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-06 22:39:31,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:31,954 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:39:31,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-11-06 22:39:31,991 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:39:31,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:39:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:32,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:32,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:32,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068271249] [2023-11-06 22:39:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068271249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:39:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981008858] [2023-11-06 22:39:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:32,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:32,110 INFO L87 Difference]: Start difference. First operand 271 states and 344 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:34,987 INFO L93 Difference]: Finished difference Result 243 states and 260 transitions. [2023-11-06 22:39:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:39:34,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-11-06 22:39:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:34,994 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:39:34,994 INFO L226 Difference]: Without dead ends: 243 [2023-11-06 22:39:34,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:39:34,996 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 435 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:34,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 431 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-06 22:39:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-06 22:39:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 218. [2023-11-06 22:39:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 156 states have (on average 1.5256410256410255) internal successors, (238), 215 states have internal predecessors, (238), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 240 transitions. [2023-11-06 22:39:35,008 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 240 transitions. Word has length 56 [2023-11-06 22:39:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:35,009 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 240 transitions. [2023-11-06 22:39:35,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 240 transitions. [2023-11-06 22:39:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:39:35,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:35,012 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:35,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:35,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:35,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:35,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1864763488, now seen corresponding path program 1 times [2023-11-06 22:39:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:35,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298820104] [2023-11-06 22:39:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:35,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:35,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:39:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:35,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:39:35,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:35,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 22:39:35,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2023-11-06 22:39:35,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:39:35,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:39:36,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:36,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:39:36,191 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:39:36,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:39:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:36,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:36,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298820104] [2023-11-06 22:39:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298820104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:36,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:36,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:39:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244007104] [2023-11-06 22:39:36,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:39:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:36,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:39:36,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:39:36,350 INFO L87 Difference]: Start difference. First operand 218 states and 240 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:39,047 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2023-11-06 22:39:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:39:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-06 22:39:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:39,050 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:39:39,050 INFO L226 Difference]: Without dead ends: 237 [2023-11-06 22:39:39,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:39:39,051 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 368 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:39,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 456 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:39:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-06 22:39:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2023-11-06 22:39:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 162 states have (on average 1.5061728395061729) internal successors, (244), 220 states have internal predecessors, (244), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 246 transitions. [2023-11-06 22:39:39,059 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 246 transitions. Word has length 59 [2023-11-06 22:39:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:39,060 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 246 transitions. [2023-11-06 22:39:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 246 transitions. [2023-11-06 22:39:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:39:39,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:39,062 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:39,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:39,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:39,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:39,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2062075433, now seen corresponding path program 1 times [2023-11-06 22:39:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991666270] [2023-11-06 22:39:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:39,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:39,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:39,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 22:39:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:39,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:39:39,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:39,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 22:39:39,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 22:39:40,120 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:39:40,120 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-06 22:39:40,200 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:39:40,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2023-11-06 22:39:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:40,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:40,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991666270] [2023-11-06 22:39:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991666270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:39:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384895105] [2023-11-06 22:39:40,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:40,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:39:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:39:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:39:40,223 INFO L87 Difference]: Start difference. First operand 223 states and 246 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:41,477 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2023-11-06 22:39:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:39:41,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-11-06 22:39:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:41,479 INFO L225 Difference]: With dead ends: 221 [2023-11-06 22:39:41,479 INFO L226 Difference]: Without dead ends: 221 [2023-11-06 22:39:41,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:39:41,480 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 159 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:41,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 583 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:39:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-06 22:39:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2023-11-06 22:39:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 218 states have internal predecessors, (241), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2023-11-06 22:39:41,488 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 62 [2023-11-06 22:39:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:41,488 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2023-11-06 22:39:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2023-11-06 22:39:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:39:41,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:41,490 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:41,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-06 22:39:41,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:41,714 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:41,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2062075432, now seen corresponding path program 1 times [2023-11-06 22:39:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652100791] [2023-11-06 22:39:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:41,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:41,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:41,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 22:39:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:42,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:39:42,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:42,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:39:42,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:39:42,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:39:42,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:39:42,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-06 22:39:42,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:39:42,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-06 22:39:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:42,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:42,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:42,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652100791] [2023-11-06 22:39:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652100791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:39:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744759064] [2023-11-06 22:39:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:42,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:39:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:39:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:39:42,822 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:44,646 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2023-11-06 22:39:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:39:44,647 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-11-06 22:39:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:44,649 INFO L225 Difference]: With dead ends: 220 [2023-11-06 22:39:44,649 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 22:39:44,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:44,650 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 162 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:44,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 578 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:39:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 22:39:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-11-06 22:39:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 217 states have internal predecessors, (239), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2023-11-06 22:39:44,658 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 62 [2023-11-06 22:39:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:44,659 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2023-11-06 22:39:44,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2023-11-06 22:39:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:39:44,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:44,660 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:44,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:44,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:44,879 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:44,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash -974867355, now seen corresponding path program 1 times [2023-11-06 22:39:44,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:44,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138945363] [2023-11-06 22:39:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:44,881 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:44,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-06 22:39:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:45,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:39:45,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:45,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:39:45,553 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:39:45,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-06 22:39:45,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:39:45,781 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-11-06 22:39:45,989 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:39:45,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-06 22:39:46,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-06 22:39:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:46,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:46,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138945363] [2023-11-06 22:39:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138945363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:39:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005106245] [2023-11-06 22:39:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:46,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:39:46,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:39:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:39:46,145 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:48,507 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2023-11-06 22:39:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:39:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2023-11-06 22:39:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:48,509 INFO L225 Difference]: With dead ends: 246 [2023-11-06 22:39:48,509 INFO L226 Difference]: Without dead ends: 246 [2023-11-06 22:39:48,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:39:48,510 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 200 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:48,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 611 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-06 22:39:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-06 22:39:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 231. [2023-11-06 22:39:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 173 states have (on average 1.4797687861271676) internal successors, (256), 228 states have internal predecessors, (256), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 258 transitions. [2023-11-06 22:39:48,519 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 258 transitions. Word has length 67 [2023-11-06 22:39:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:48,520 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 258 transitions. [2023-11-06 22:39:48,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 258 transitions. [2023-11-06 22:39:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:39:48,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:48,521 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:48,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:48,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:48,737 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:48,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash -974867354, now seen corresponding path program 1 times [2023-11-06 22:39:48,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:48,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127494979] [2023-11-06 22:39:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:48,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:48,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:48,740 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:48,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-06 22:39:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:49,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:39:49,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:49,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:39:49,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:39:49,466 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:39:49,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:39:49,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:39:49,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:39:49,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-06 22:39:49,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:39:49,918 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:39:49,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:39:49,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:39:50,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:39:50,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-06 22:39:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:39:50,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:50,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:50,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127494979] [2023-11-06 22:39:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127494979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:39:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859813100] [2023-11-06 22:39:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:39:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:39:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:39:50,149 INFO L87 Difference]: Start difference. First operand 231 states and 258 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:39:52,896 INFO L93 Difference]: Finished difference Result 243 states and 262 transitions. [2023-11-06 22:39:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:39:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2023-11-06 22:39:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:39:52,898 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:39:52,898 INFO L226 Difference]: Without dead ends: 243 [2023-11-06 22:39:52,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:39:52,899 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 346 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:39:52,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 521 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-06 22:39:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-06 22:39:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2023-11-06 22:39:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 228 states have internal predecessors, (252), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2023-11-06 22:39:52,906 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 67 [2023-11-06 22:39:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:39:52,907 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2023-11-06 22:39:52,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:39:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2023-11-06 22:39:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:39:52,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:39:52,908 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 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] [2023-11-06 22:39:52,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:53,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:53,121 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:39:53,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash -712333911, now seen corresponding path program 1 times [2023-11-06 22:39:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013209536] [2023-11-06 22:39:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:53,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:53,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:53,123 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:53,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-06 22:39:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:53,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:39:53,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:53,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:39:53,961 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:39:53,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-06 22:39:54,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:39:54,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-11-06 22:39:54,401 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:39:54,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-06 22:39:54,614 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:39:54,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-06 22:39:54,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-06 22:39:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-11-06 22:39:54,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:54,899 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 22:39:54,933 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_974) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-06 22:39:54,981 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_973 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_973))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_974)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 22:39:55,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_973 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_973))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_974)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 22:39:55,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_973 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_972 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_972))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_973)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_974)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-06 22:39:55,121 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:55,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-11-06 22:39:55,128 INFO L351 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 5799 treesize of output 4476 [2023-11-06 22:39:55,239 INFO L351 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 993 treesize of output 769 [2023-11-06 22:39:55,252 INFO L351 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 769 treesize of output 685 [2023-11-06 22:39:55,264 INFO L351 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 685 treesize of output 531 [2023-11-06 22:39:58,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:58,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 114 treesize of output 456 [2023-11-06 22:40:05,042 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2023-11-06 22:40:05,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013209536] [2023-11-06 22:40:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013209536] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:05,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-06 22:40:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790577742] [2023-11-06 22:40:05,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:05,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:40:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:05,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:40:05,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2023-11-06 22:40:05,046 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:08,012 INFO L93 Difference]: Finished difference Result 239 states and 258 transitions. [2023-11-06 22:40:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:40:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2023-11-06 22:40:08,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:08,014 INFO L225 Difference]: With dead ends: 239 [2023-11-06 22:40:08,014 INFO L226 Difference]: Without dead ends: 239 [2023-11-06 22:40:08,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=203, Unknown=5, NotChecked=170, Total=462 [2023-11-06 22:40:08,016 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 441 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 909 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:40:08,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 794 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 516 Invalid, 0 Unknown, 909 Unchecked, 2.6s Time] [2023-11-06 22:40:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-06 22:40:08,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2023-11-06 22:40:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 173 states have (on average 1.4450867052023122) internal successors, (250), 227 states have internal predecessors, (250), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2023-11-06 22:40:08,023 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 73 [2023-11-06 22:40:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:08,024 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2023-11-06 22:40:08,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2023-11-06 22:40:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:40:08,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:08,025 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 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] [2023-11-06 22:40:08,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-06 22:40:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:08,244 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:40:08,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -712333910, now seen corresponding path program 1 times [2023-11-06 22:40:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040130219] [2023-11-06 22:40:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:08,246 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:08,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-06 22:40:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:08,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:40:08,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:08,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:40:08,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:40:09,024 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:40:09,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:40:09,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:40:09,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:40:09,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-06 22:40:09,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:40:09,489 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:40:09,489 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:40:09,512 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:40:09,834 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:40:09,834 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:40:09,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:40:10,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:40:10,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-06 22:40:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-11-06 22:40:10,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:11,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd (_ bv1 64) .cse2 .cse1)))))) is different from false [2023-11-06 22:40:11,756 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:40:11,922 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-06 22:40:12,110 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1088))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1089) .cse1 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1089) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 22:40:12,255 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1089) .cse1 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1089) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-11-06 22:40:12,636 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1087 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1086 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1087))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1086) .cse2 v_ArrVal_1089) (select (select (store .cse3 .cse2 v_ArrVal_1088) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1091))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1091 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1090 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1088 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1087 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1089 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1086 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1087))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1088))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1086) .cse5 v_ArrVal_1089) .cse6 v_ArrVal_1091) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1090) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 22:40:12,818 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:12,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-11-06 22:40:12,849 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:12,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-06 22:40:12,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 771 treesize of output 636 [2023-11-06 22:40:12,879 INFO L351 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 6441 treesize of output 6054 [2023-11-06 22:40:12,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 194 [2023-11-06 22:40:12,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 166 [2023-11-06 22:40:12,901 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 138 [2023-11-06 22:40:13,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2023-11-06 22:40:13,101 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2023-11-06 22:40:13,277 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:13,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-06 22:40:13,309 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:13,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-06 22:40:13,318 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:13,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1227 treesize of output 768 [2023-11-06 22:40:13,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:13,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:13,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:40:13,906 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 22:40:13,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-11-06 22:40:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2023-11-06 22:40:13,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:13,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040130219] [2023-11-06 22:40:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040130219] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:13,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-11-06 22:40:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88770791] [2023-11-06 22:40:13,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:40:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:40:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=260, Unknown=6, NotChecked=222, Total=552 [2023-11-06 22:40:13,915 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:25,297 INFO L93 Difference]: Finished difference Result 255 states and 273 transitions. [2023-11-06 22:40:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:40:25,298 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2023-11-06 22:40:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:25,299 INFO L225 Difference]: With dead ends: 255 [2023-11-06 22:40:25,299 INFO L226 Difference]: Without dead ends: 255 [2023-11-06 22:40:25,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=165, Invalid=609, Unknown=6, NotChecked=342, Total=1122 [2023-11-06 22:40:25,301 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 527 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1195 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:40:25,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 995 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1040 Invalid, 0 Unknown, 1195 Unchecked, 9.1s Time] [2023-11-06 22:40:25,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-06 22:40:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 242. [2023-11-06 22:40:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 185 states have (on average 1.4216216216216215) internal successors, (263), 239 states have internal predecessors, (263), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2023-11-06 22:40:25,309 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 73 [2023-11-06 22:40:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:25,309 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2023-11-06 22:40:25,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 24 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2023-11-06 22:40:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:40:25,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:25,310 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 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] [2023-11-06 22:40:25,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 22:40:25,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:25,525 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:40:25,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:25,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1604348946, now seen corresponding path program 2 times [2023-11-06 22:40:25,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781203756] [2023-11-06 22:40:25,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:40:25,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:25,527 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:25,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-06 22:40:26,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:40:26,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:40:26,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 22:40:26,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:26,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:40:26,481 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:40:26,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:40:26,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:40:26,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:40:26,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:40:26,714 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-06 22:40:26,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:40:26,986 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:40:26,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:40:26,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:40:27,362 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:40:27,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:40:27,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:40:27,762 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:40:27,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:40:27,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:40:27,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:40:27,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-06 22:40:28,075 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:40:28,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:29,583 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:40:29,779 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd (_ bv1 64) .cse3 .cse2))))))) is different from false [2023-11-06 22:40:29,947 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 22:40:30,126 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1213))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1214) .cse0 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1214) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-11-06 22:40:31,525 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1214) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1213))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1214) .cse4 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:40:31,714 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv2 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1213))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1214) .cse1 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1214) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 22:40:32,074 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1211))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1212) .cse2 v_ArrVal_1214) (select (select (store .cse3 .cse2 v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1215))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1211))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1213))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1212) .cse5 v_ArrVal_1214) .cse6 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-06 22:40:34,276 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1211))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1212) .cse3 v_ArrVal_1214) (select (select (store .cse4 .cse3 v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1215))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1211))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1213))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1212) .cse6 v_ArrVal_1214) .cse7 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-06 22:40:36,520 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1216 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1210 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1209 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1209))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1211))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1213))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1210) .cse0 v_ArrVal_1212) .cse1 v_ArrVal_1214) .cse2 v_ArrVal_1215) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1216) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1213 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1212 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1215 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1214 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1211 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1210 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1209 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1209))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1211))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1210) .cse9 v_ArrVal_1212) .cse10 v_ArrVal_1214) (select (select (store .cse11 .cse10 v_ArrVal_1213) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1215))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd (_ bv1 64) .cse8 .cse4)))))) is different from false [2023-11-06 22:40:36,782 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:36,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2023-11-06 22:40:36,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:36,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2023-11-06 22:40:36,886 INFO L351 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 23859 treesize of output 19170 [2023-11-06 22:40:36,989 INFO L351 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 61624 treesize of output 59527 [2023-11-06 22:40:37,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 527 treesize of output 457 [2023-11-06 22:40:37,054 INFO L351 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 457 treesize of output 429 [2023-11-06 22:40:37,065 INFO L351 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 429 treesize of output 345 [2023-11-06 22:40:37,251 INFO L351 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 161 [2023-11-06 22:40:37,262 INFO L351 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 282 [2023-11-06 22:40:37,273 INFO L351 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 282 treesize of output 254 [2023-11-06 22:40:37,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 119 [2023-11-06 22:40:38,569 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:38,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-06 22:40:38,613 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:38,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-06 22:40:38,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:38,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28859 treesize of output 20732 [2023-11-06 22:40:38,721 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:38,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:38,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:40:39,619 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 22:40:39,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-11-06 22:40:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 14 not checked. [2023-11-06 22:40:39,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781203756] [2023-11-06 22:40:39,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781203756] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:39,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2023-11-06 22:40:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729322339] [2023-11-06 22:40:39,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:39,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:40:39,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:40:39,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=364, Unknown=9, NotChecked=414, Total=870 [2023-11-06 22:40:39,631 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 30 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 30 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:40:58,348 INFO L93 Difference]: Finished difference Result 268 states and 286 transitions. [2023-11-06 22:40:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:40:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 30 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2023-11-06 22:40:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:40:58,353 INFO L225 Difference]: With dead ends: 268 [2023-11-06 22:40:58,353 INFO L226 Difference]: Without dead ends: 268 [2023-11-06 22:40:58,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=210, Invalid=873, Unknown=9, NotChecked=630, Total=1722 [2023-11-06 22:40:58,354 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 365 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1891 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:40:58,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1192 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1269 Invalid, 0 Unknown, 1891 Unchecked, 14.2s Time] [2023-11-06 22:40:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-06 22:40:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 254. [2023-11-06 22:40:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.401015228426396) internal successors, (276), 251 states have internal predecessors, (276), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 278 transitions. [2023-11-06 22:40:58,363 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 278 transitions. Word has length 79 [2023-11-06 22:40:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:40:58,364 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 278 transitions. [2023-11-06 22:40:58,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 30 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:40:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2023-11-06 22:40:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 22:40:58,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:40:58,365 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:58,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:58,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:58,581 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 70 more)] === [2023-11-06 22:40:58,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 342998834, now seen corresponding path program 3 times [2023-11-06 22:40:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:58,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265619000] [2023-11-06 22:40:58,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:40:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:58,584 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:58,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81441a01-cf18-43f1-87b1-6e0dc97ea1c0/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-06 22:40:59,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:40:59,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:40:59,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-06 22:40:59,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:59,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:40:59,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:40:59,685 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 22:40:59,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 22:40:59,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-06 22:40:59,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-06 22:41:00,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-06 22:41:00,091 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-06 22:41:00,449 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:41:00,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:41:00,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:41:01,041 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:41:01,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:41:01,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:41:01,747 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:41:01,747 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:41:01,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:41:02,483 INFO L322 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-06 22:41:02,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-06 22:41:02,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-06 22:41:02,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-06 22:41:02,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-06 22:41:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-11-06 22:41:03,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:04,851 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-06 22:41:05,043 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd (_ bv1 64) .cse3 .cse2))))))) is different from false [2023-11-06 22:41:05,262 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd .cse0 (_ bv1 64) .cse3))))))) is different from false [2023-11-06 22:41:05,469 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1347))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1346) .cse1 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-06 22:41:05,784 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1347))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1346) .cse2 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-06 22:41:06,019 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1347))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1346) .cse4 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-06 22:41:06,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1345))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1347))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1344) .cse0 v_ArrVal_1346) .cse1 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1345))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1344) .cse7 v_ArrVal_1346) (select (select (store .cse8 .cse7 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1348))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd (_ bv1 64) .cse6 .cse3)))))) is different from false [2023-11-06 22:41:08,845 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1345))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1344) .cse3 v_ArrVal_1346) (select (select (store .cse4 .cse3 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1348))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1345))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1347))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1344) .cse6 v_ArrVal_1346) .cse7 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-06 22:41:09,262 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1345))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1344) .cse3 v_ArrVal_1346) (select (select (store .cse4 .cse3 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1348))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1345))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1347))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1344) .cse6 v_ArrVal_1346) .cse7 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-06 22:41:09,778 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1342))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1345))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1347))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1343) .cse0 v_ArrVal_1344) .cse1 v_ArrVal_1346) .cse2 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1342))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1345))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem142#1.base| v_ArrVal_1343) .cse9 v_ArrVal_1344) .cse10 v_ArrVal_1346) (select (select (store .cse11 .cse10 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1348))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 .cse4 (_ bv1 64))))))) is different from false [2023-11-06 22:41:12,574 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1342))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1345))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1343) .cse3 v_ArrVal_1344) .cse4 v_ArrVal_1346) (select (select (store .cse5 .cse4 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1348))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1342))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1345))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1347))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1343) .cse8 v_ArrVal_1344) .cse9 v_ArrVal_1346) .cse10 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-06 22:41:15,298 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ sign_extend 32) (_ bv3 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1349 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1341 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1340 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1340))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse0 v_ArrVal_1342))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse1 v_ArrVal_1345))) (let ((.cse2 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse2 v_ArrVal_1347))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1341) .cse0 v_ArrVal_1343) .cse1 v_ArrVal_1344) .cse2 v_ArrVal_1346) .cse3 v_ArrVal_1348) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) .cse5 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1349) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_1348 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1345 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1344 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1341 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1340 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1343 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1342 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1340))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_1342))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_1345))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1341) .cse11 v_ArrVal_1343) .cse12 v_ArrVal_1344) .cse13 v_ArrVal_1346) (select (select (store .cse14 .cse13 v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1348))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse10 .cse5) (bvadd .cse10 .cse5 (_ bv1 64))))))) is different from false [2023-11-06 22:41:15,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:15,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 900 treesize of output 888 [2023-11-06 22:41:16,110 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:16,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 874 treesize of output 498 [2023-11-06 22:41:16,192 INFO L351 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 35810095 treesize of output 30791254 [2023-11-06 22:42:06,631 WARN L293 SmtUtils]: Spent 50.43s on a formula simplification. DAG size of input: 1705 DAG size of output: 497 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 22:42:07,245 INFO L351 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 1666162 treesize of output 1625329 [2023-11-06 22:42:12,763 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 929 DAG size of output: 374 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 22:42:13,526 INFO L351 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 135977 treesize of output 126142 [2023-11-06 22:42:14,263 INFO L351 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 126142 treesize of output 116174 [2023-11-06 22:42:15,028 INFO L351 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 116174 treesize of output 97764 [2023-11-06 22:42:15,800 INFO L351 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 97764 treesize of output 93872 [2023-11-06 22:42:16,585 INFO L351 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 93872 treesize of output 91380 [2023-11-06 22:42:17,357 INFO L351 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 91380 treesize of output 80145 [2023-11-06 22:42:18,157 INFO L351 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 80145 treesize of output 75483 [2023-11-06 22:42:18,896 INFO L351 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 75483 treesize of output 68637 [2023-11-06 22:42:19,656 INFO L351 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 68637 treesize of output 65949 [2023-11-06 22:42:38,608 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 899 treesize of output 900 [2023-11-06 22:42:38,697 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:42:38,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 497 [2023-11-06 22:42:38,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:38,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1110467 treesize of output 866792 [2023-11-06 22:42:39,196 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:39,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:42:39,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-06 22:42:40,916 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-06 22:42:40,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-11-06 22:42:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 30 not checked. [2023-11-06 22:42:40,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:42:40,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265619000] [2023-11-06 22:42:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265619000] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:40,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:42:40,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2023-11-06 22:42:40,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694332675] [2023-11-06 22:42:40,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:40,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:42:40,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:42:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:42:40,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=360, Unknown=12, NotChecked=588, Total=1056 [2023-11-06 22:42:40,929 INFO L87 Difference]: Start difference. First operand 254 states and 278 transitions. Second operand has 33 states, 32 states have (on average 2.5) internal successors, (80), 33 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)