./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:14:18,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:14:18,889 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:14:18,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:14:18,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:14:18,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:14:18,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:14:18,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:14:18,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:14:18,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:14:18,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:14:18,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:14:18,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:14:18,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:14:18,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:14:18,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:14:18,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:14:18,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:14:18,941 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:14:18,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:18,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:18,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:18,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:14:18,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:14:18,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:14:18,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:14:18,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:14:18,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:14:18,945 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-27 20:14:19,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:14:19,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:14:19,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:14:19,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:14:19,308 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:14:19,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-27 20:14:22,419 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/430b4ff70/bdeddc1adff04c27ab90b65adcc17838/FLAGc0cdf285c [2024-11-27 20:14:22,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:22,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-27 20:14:22,892 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/430b4ff70/bdeddc1adff04c27ab90b65adcc17838/FLAGc0cdf285c [2024-11-27 20:14:22,910 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/430b4ff70/bdeddc1adff04c27ab90b65adcc17838 [2024-11-27 20:14:22,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:22,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:22,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:22,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:22,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:22,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:22" (1/1) ... [2024-11-27 20:14:22,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed5ccd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:22, skipping insertion in model container [2024-11-27 20:14:22,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:22" (1/1) ... [2024-11-27 20:14:22,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:23,500 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,542 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,548 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,554 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,565 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,599 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,601 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,604 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,610 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,640 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,640 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,643 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,643 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,645 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,648 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,650 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,651 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,652 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,657 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,658 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,659 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,659 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,663 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:23,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:23,690 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-27 20:14:23,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7aaaf00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:23, skipping insertion in model container [2024-11-27 20:14:23,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:23,691 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-27 20:14:23,697 INFO L158 Benchmark]: Toolchain (without parser) took 778.94ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 67.4MB in the end (delta: 24.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:23,698 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:23,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 775.59ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.8MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:23,699 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.52ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 775.59ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.8MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:14:26,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:14:26,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:14:26,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:14:26,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:14:26,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:14:26,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:14:26,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:14:26,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:14:26,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:14:26,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:14:26,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:14:26,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:14:26,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:14:26,613 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:14:26,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:14:26,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:14:26,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:14:26,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:14:26,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:14:26,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:14:26,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:14:26,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:14:26,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:14:26,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:26,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:26,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:26,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:14:26,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:14:26,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-27 20:14:26,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:14:26,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:14:26,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:14:26,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:14:26,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:14:26,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-27 20:14:30,073 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/f566aa6f7/bb991b61b4944238a9ee8c99a394848f/FLAGae58fd14f [2024-11-27 20:14:30,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:30,565 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-27 20:14:30,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/f566aa6f7/bb991b61b4944238a9ee8c99a394848f/FLAGae58fd14f [2024-11-27 20:14:30,626 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/data/f566aa6f7/bb991b61b4944238a9ee8c99a394848f [2024-11-27 20:14:30,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:30,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:30,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:30,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:30,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:30,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:30" (1/1) ... [2024-11-27 20:14:30,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eac3442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:30, skipping insertion in model container [2024-11-27 20:14:30,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:30" (1/1) ... [2024-11-27 20:14:30,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:31,306 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,377 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,385 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,397 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,414 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,464 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,468 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,479 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,498 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,548 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,549 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,553 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,553 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,556 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,560 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,561 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,563 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,564 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,571 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,573 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,574 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,575 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,580 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:31,627 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-27 20:14:31,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:31,714 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,747 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,750 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,753 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,759 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,796 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,799 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,803 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,813 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,846 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,846 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,852 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,852 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,854 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,859 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,860 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,861 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,861 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,866 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,868 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,869 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,870 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,874 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:14:31,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:31,886 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:14:32,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:32,097 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:14:32,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32 WrapperNode [2024-11-27 20:14:32,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:32,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:32,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:14:32,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:14:32,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,236 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1704 [2024-11-27 20:14:32,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:32,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:14:32,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:14:32,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:14:32,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,524 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-11-27 20:14:32,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:14:32,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:14:32,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:14:32,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:14:32,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (1/1) ... [2024-11-27 20:14:32,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:32,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:32,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:14:32,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:14:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-27 20:14:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-27 20:14:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:14:32,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:14:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-27 20:14:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-27 20:14:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-27 20:14:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:14:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:14:32,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:14:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:14:32,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:14:32,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:14:33,047 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:14:33,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:14:33,075 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:14:33,119 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:14:33,150 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:14:42,185 INFO L? ?]: Removed 1906 outVars from TransFormulas that were not future-live. [2024-11-27 20:14:42,186 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:14:42,257 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:14:42,260 INFO L312 CfgBuilder]: Removed 56 assume(true) statements. [2024-11-27 20:14:42,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:42 BoogieIcfgContainer [2024-11-27 20:14:42,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:14:42,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:14:42,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:14:42,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:14:42,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:14:30" (1/3) ... [2024-11-27 20:14:42,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14856c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:42, skipping insertion in model container [2024-11-27 20:14:42,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:32" (2/3) ... [2024-11-27 20:14:42,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14856c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:42, skipping insertion in model container [2024-11-27 20:14:42,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:42" (3/3) ... [2024-11-27 20:14:42,275 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-3.i [2024-11-27 20:14:42,292 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:14:42,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-3.i that has 6 procedures, 1835 locations, 1 initial locations, 58 loop locations, and 915 error locations. [2024-11-27 20:14:42,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:14:42,405 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6afccbc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:14:42,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 915 error locations. [2024-11-27 20:14:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 1825 states, 899 states have (on average 2.235817575083426) internal successors, (2010), 1815 states have internal predecessors, (2010), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-27 20:14:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:14:42,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:42,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:14:42,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-27 20:14:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811543396] [2024-11-27 20:14:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:42,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:42,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:42,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:14:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:42,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:14:42,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:42,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:42,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:42,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811543396] [2024-11-27 20:14:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811543396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:42,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:42,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415035927] [2024-11-27 20:14:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:42,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:14:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:42,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:14:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:14:42,744 INFO L87 Difference]: Start difference. First operand has 1825 states, 899 states have (on average 2.235817575083426) internal successors, (2010), 1815 states have internal predecessors, (2010), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2024-11-27 20:14:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:42,849 INFO L93 Difference]: Finished difference Result 1805 states and 1906 transitions. [2024-11-27 20:14:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:14:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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 [2024-11-27 20:14:42,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:42,884 INFO L225 Difference]: With dead ends: 1805 [2024-11-27 20:14:42,885 INFO L226 Difference]: Without dead ends: 1803 [2024-11-27 20:14:42,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:14:42,892 INFO L435 NwaCegarLoop]: 1906 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:42,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:14:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-27 20:14:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2024-11-27 20:14:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 889 states have (on average 2.1147356580427448) internal successors, (1880), 1793 states have internal predecessors, (1880), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 20:14:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 1904 transitions. [2024-11-27 20:14:43,014 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 1904 transitions. Word has length 6 [2024-11-27 20:14:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:43,015 INFO L471 AbstractCegarLoop]: Abstraction has 1803 states and 1904 transitions. [2024-11-27 20:14:43,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) [2024-11-27 20:14:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 1904 transitions. [2024-11-27 20:14:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:14:43,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:43,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:14:43,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:14:43,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:43,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:43,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-27 20:14:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058429932] [2024-11-27 20:14:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:43,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:43,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:14:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:43,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:14:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:43,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:14:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:43,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:43,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058429932] [2024-11-27 20:14:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058429932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108246992] [2024-11-27 20:14:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:43,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:43,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:43,489 INFO L87 Difference]: Start difference. First operand 1803 states and 1904 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:47,194 INFO L93 Difference]: Finished difference Result 1940 states and 2073 transitions. [2024-11-27 20:14:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:14:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:47,202 INFO L225 Difference]: With dead ends: 1940 [2024-11-27 20:14:47,202 INFO L226 Difference]: Without dead ends: 1940 [2024-11-27 20:14:47,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:47,204 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1265 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:47,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1746 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-27 20:14:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-27 20:14:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1711. [2024-11-27 20:14:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 889 states have (on average 2.0112485939257594) internal successors, (1788), 1701 states have internal predecessors, (1788), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 20:14:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 1812 transitions. [2024-11-27 20:14:47,254 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 1812 transitions. Word has length 6 [2024-11-27 20:14:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:47,254 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 1812 transitions. [2024-11-27 20:14:47,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 1812 transitions. [2024-11-27 20:14:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:14:47,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:47,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:14:47,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:14:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:47,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-27 20:14:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [505069017] [2024-11-27 20:14:47,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:47,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:47,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:47,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:14:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:47,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:14:47,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:47,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:14:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:47,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:47,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505069017] [2024-11-27 20:14:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505069017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:47,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056642249] [2024-11-27 20:14:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:47,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:47,707 INFO L87 Difference]: Start difference. First operand 1711 states and 1812 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:52,854 INFO L93 Difference]: Finished difference Result 2258 states and 2410 transitions. [2024-11-27 20:14:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:14:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:52,863 INFO L225 Difference]: With dead ends: 2258 [2024-11-27 20:14:52,863 INFO L226 Difference]: Without dead ends: 2258 [2024-11-27 20:14:52,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:52,864 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 769 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:52,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2543 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-27 20:14:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2024-11-27 20:14:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 1878. [2024-11-27 20:14:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1066 states have (on average 1.977485928705441) internal successors, (2108), 1868 states have internal predecessors, (2108), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-27 20:14:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2132 transitions. [2024-11-27 20:14:52,914 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2132 transitions. Word has length 6 [2024-11-27 20:14:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2132 transitions. [2024-11-27 20:14:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2132 transitions. [2024-11-27 20:14:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:14:52,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:52,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:14:52,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:53,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:53,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422772, now seen corresponding path program 1 times [2024-11-27 20:14:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416002723] [2024-11-27 20:14:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:53,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:53,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:14:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:53,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:14:53,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:53,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:14:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:53,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:53,325 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:53,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416002723] [2024-11-27 20:14:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416002723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:53,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:14:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72005621] [2024-11-27 20:14:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:53,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:53,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:53,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:53,327 INFO L87 Difference]: Start difference. First operand 1878 states and 2132 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:58,004 INFO L93 Difference]: Finished difference Result 3365 states and 3841 transitions. [2024-11-27 20:14:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:14:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:58,016 INFO L225 Difference]: With dead ends: 3365 [2024-11-27 20:14:58,016 INFO L226 Difference]: Without dead ends: 3365 [2024-11-27 20:14:58,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:58,017 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 1589 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:58,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2076 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-27 20:14:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2024-11-27 20:14:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 2407. [2024-11-27 20:14:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 1596 states have (on average 1.9404761904761905) internal successors, (3097), 2393 states have internal predecessors, (3097), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:14:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 3129 transitions. [2024-11-27 20:14:58,085 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 3129 transitions. Word has length 6 [2024-11-27 20:14:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:58,085 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 3129 transitions. [2024-11-27 20:14:58,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 3129 transitions. [2024-11-27 20:14:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:14:58,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:58,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:14:58,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:14:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:58,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:58,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422773, now seen corresponding path program 1 times [2024-11-27 20:14:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080524981] [2024-11-27 20:14:58,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:58,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:58,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:14:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:58,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:14:58,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:58,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:58,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080524981] [2024-11-27 20:14:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080524981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:58,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463258541] [2024-11-27 20:14:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:58,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:14:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:58,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:14:58,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:58,525 INFO L87 Difference]: Start difference. First operand 2407 states and 3129 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:58,710 INFO L93 Difference]: Finished difference Result 4065 states and 5181 transitions. [2024-11-27 20:14:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:14:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:14:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:58,731 INFO L225 Difference]: With dead ends: 4065 [2024-11-27 20:14:58,731 INFO L226 Difference]: Without dead ends: 4065 [2024-11-27 20:14:58,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:14:58,733 INFO L435 NwaCegarLoop]: 2067 mSDtfsCounter, 1357 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3857 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:58,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3857 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:58,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2024-11-27 20:14:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 2409. [2024-11-27 20:14:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1598 states have (on average 1.9386733416770963) internal successors, (3098), 2395 states have internal predecessors, (3098), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:14:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3130 transitions. [2024-11-27 20:14:58,802 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3130 transitions. Word has length 6 [2024-11-27 20:14:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3130 transitions. [2024-11-27 20:14:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3130 transitions. [2024-11-27 20:14:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:14:58,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:58,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:58,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:14:59,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:59,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:14:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-27 20:14:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705071834] [2024-11-27 20:14:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:59,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:59,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:59,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:14:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:59,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:14:59,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:14:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:59,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:59,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705071834] [2024-11-27 20:14:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705071834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:59,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:14:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031704967] [2024-11-27 20:14:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:59,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:59,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:59,311 INFO L87 Difference]: Start difference. First operand 2409 states and 3130 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:04,085 INFO L93 Difference]: Finished difference Result 2395 states and 3093 transitions. [2024-11-27 20:15:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:15:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-27 20:15:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:04,095 INFO L225 Difference]: With dead ends: 2395 [2024-11-27 20:15:04,095 INFO L226 Difference]: Without dead ends: 2395 [2024-11-27 20:15:04,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:04,097 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 1315 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:04,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2105 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-27 20:15:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2024-11-27 20:15:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2386. [2024-11-27 20:15:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 1598 states have (on average 1.9098873591989987) internal successors, (3052), 2372 states have internal predecessors, (3052), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3084 transitions. [2024-11-27 20:15:04,159 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3084 transitions. Word has length 12 [2024-11-27 20:15:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:04,159 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3084 transitions. [2024-11-27 20:15:04,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3084 transitions. [2024-11-27 20:15:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:15:04,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:04,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:04,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:04,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:04,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:04,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-27 20:15:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930048207] [2024-11-27 20:15:04,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:04,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:04,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:15:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:04,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:15:04,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:04,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:15:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:04,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:04,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930048207] [2024-11-27 20:15:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930048207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:04,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:04,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:15:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199361319] [2024-11-27 20:15:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:04,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:15:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:04,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:15:04,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:15:04,761 INFO L87 Difference]: Start difference. First operand 2386 states and 3084 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:11,714 INFO L93 Difference]: Finished difference Result 2912 states and 3534 transitions. [2024-11-27 20:15:11,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:15:11,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-27 20:15:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:11,723 INFO L225 Difference]: With dead ends: 2912 [2024-11-27 20:15:11,723 INFO L226 Difference]: Without dead ends: 2912 [2024-11-27 20:15:11,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:11,724 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 893 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:11,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 3141 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-27 20:15:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2024-11-27 20:15:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2502. [2024-11-27 20:15:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 1714 states have (on average 1.8623103850641773) internal successors, (3192), 2488 states have internal predecessors, (3192), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 3224 transitions. [2024-11-27 20:15:11,799 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 3224 transitions. Word has length 12 [2024-11-27 20:15:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:11,800 INFO L471 AbstractCegarLoop]: Abstraction has 2502 states and 3224 transitions. [2024-11-27 20:15:11,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 3224 transitions. [2024-11-27 20:15:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-27 20:15:11,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:11,803 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:11,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:15:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:12,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1395848739, now seen corresponding path program 1 times [2024-11-27 20:15:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740090068] [2024-11-27 20:15:12,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:12,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:12,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:12,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:15:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:12,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:15:12,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:12,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:15:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:12,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:13,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740090068] [2024-11-27 20:15:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740090068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:15:13,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:15:13,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-27 20:15:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990697189] [2024-11-27 20:15:13,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:15:13,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:15:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:13,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:15:13,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:15:13,243 INFO L87 Difference]: Start difference. First operand 2502 states and 3224 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:28,858 INFO L93 Difference]: Finished difference Result 3326 states and 4110 transitions. [2024-11-27 20:15:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:15:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-27 20:15:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:28,865 INFO L225 Difference]: With dead ends: 3326 [2024-11-27 20:15:28,865 INFO L226 Difference]: Without dead ends: 3326 [2024-11-27 20:15:28,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:15:28,866 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 2692 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:28,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 4136 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2024-11-27 20:15:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2024-11-27 20:15:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2668. [2024-11-27 20:15:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 1880 states have (on average 1.8223404255319149) internal successors, (3426), 2654 states have internal predecessors, (3426), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 3458 transitions. [2024-11-27 20:15:28,924 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 3458 transitions. Word has length 31 [2024-11-27 20:15:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:28,925 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 3458 transitions. [2024-11-27 20:15:28,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 3458 transitions. [2024-11-27 20:15:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 20:15:28,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:28,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:28,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:15:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:29,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1652938312, now seen corresponding path program 1 times [2024-11-27 20:15:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326656164] [2024-11-27 20:15:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:29,131 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:29,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:15:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:29,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:15:29,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:29,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:29,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:29,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326656164] [2024-11-27 20:15:29,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326656164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:15:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555580972] [2024-11-27 20:15:29,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:29,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:15:29,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:29,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:15:29,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:15:29,764 INFO L87 Difference]: Start difference. First operand 2668 states and 3458 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:30,085 INFO L93 Difference]: Finished difference Result 3263 states and 4148 transitions. [2024-11-27 20:15:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:15:30,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2024-11-27 20:15:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:30,098 INFO L225 Difference]: With dead ends: 3263 [2024-11-27 20:15:30,098 INFO L226 Difference]: Without dead ends: 3263 [2024-11-27 20:15:30,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:15:30,099 INFO L435 NwaCegarLoop]: 1848 mSDtfsCounter, 441 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 3559 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:30,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 3559 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:15:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2024-11-27 20:15:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 2889. [2024-11-27 20:15:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2101 states have (on average 1.7743931461208948) internal successors, (3728), 2875 states have internal predecessors, (3728), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 3760 transitions. [2024-11-27 20:15:30,157 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 3760 transitions. Word has length 44 [2024-11-27 20:15:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:30,157 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 3760 transitions. [2024-11-27 20:15:30,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 3760 transitions. [2024-11-27 20:15:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:15:30,159 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:30,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:30,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:30,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:30,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:30,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -994558784, now seen corresponding path program 1 times [2024-11-27 20:15:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547686381] [2024-11-27 20:15:30,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:30,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:30,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:30,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:15:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:30,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:15:30,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:30,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:30,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:30,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547686381] [2024-11-27 20:15:30,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547686381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:30,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:15:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567908006] [2024-11-27 20:15:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:15:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:30,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:15:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:15:30,800 INFO L87 Difference]: Start difference. First operand 2889 states and 3760 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:30,956 INFO L93 Difference]: Finished difference Result 2428 states and 3100 transitions. [2024-11-27 20:15:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:15:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-11-27 20:15:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:30,967 INFO L225 Difference]: With dead ends: 2428 [2024-11-27 20:15:30,967 INFO L226 Difference]: Without dead ends: 2428 [2024-11-27 20:15:30,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:30,968 INFO L435 NwaCegarLoop]: 1716 mSDtfsCounter, 56 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:30,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 5075 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:15:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2024-11-27 20:15:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2425. [2024-11-27 20:15:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2425 states, 1660 states have (on average 1.8463855421686748) internal successors, (3065), 2411 states have internal predecessors, (3065), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2425 states and 3097 transitions. [2024-11-27 20:15:31,015 INFO L78 Accepts]: Start accepts. Automaton has 2425 states and 3097 transitions. Word has length 47 [2024-11-27 20:15:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:31,016 INFO L471 AbstractCegarLoop]: Abstraction has 2425 states and 3097 transitions. [2024-11-27 20:15:31,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 3097 transitions. [2024-11-27 20:15:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 20:15:31,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:31,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:31,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:31,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:31,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:31,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1215894668, now seen corresponding path program 1 times [2024-11-27 20:15:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886844018] [2024-11-27 20:15:31,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:31,227 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:31,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:15:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:31,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:15:31,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:31,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:15:32,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:15:32,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:15:32,359 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:15:32,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:15:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:32,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:32,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:32,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886844018] [2024-11-27 20:15:32,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886844018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:32,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:15:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558458493] [2024-11-27 20:15:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:32,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:15:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:15:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:32,381 INFO L87 Difference]: Start difference. First operand 2425 states and 3097 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:38,142 INFO L93 Difference]: Finished difference Result 2341 states and 2977 transitions. [2024-11-27 20:15:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:15:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2024-11-27 20:15:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:38,150 INFO L225 Difference]: With dead ends: 2341 [2024-11-27 20:15:38,150 INFO L226 Difference]: Without dead ends: 2341 [2024-11-27 20:15:38,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:15:38,151 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2333 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2344 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:38,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2344 Valid, 1632 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-27 20:15:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2024-11-27 20:15:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1991. [2024-11-27 20:15:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1310 states have (on average 1.7473282442748093) internal successors, (2289), 1977 states have internal predecessors, (2289), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2321 transitions. [2024-11-27 20:15:38,197 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2321 transitions. Word has length 55 [2024-11-27 20:15:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 1991 states and 2321 transitions. [2024-11-27 20:15:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2321 transitions. [2024-11-27 20:15:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-27 20:15:38,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:38,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:38,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:15:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:38,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -474771177, now seen corresponding path program 1 times [2024-11-27 20:15:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963949667] [2024-11-27 20:15:38,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:38,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:38,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:38,405 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:38,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:15:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:38,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:15:38,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:38,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:15:38,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:15:38,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:15:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:38,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:38,818 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:38,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963949667] [2024-11-27 20:15:38,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963949667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:38,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:38,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:15:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167787727] [2024-11-27 20:15:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:38,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:15:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:38,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:15:38,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:38,820 INFO L87 Difference]: Start difference. First operand 1991 states and 2321 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:43,608 INFO L93 Difference]: Finished difference Result 1990 states and 2319 transitions. [2024-11-27 20:15:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:15:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-11-27 20:15:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:43,615 INFO L225 Difference]: With dead ends: 1990 [2024-11-27 20:15:43,615 INFO L226 Difference]: Without dead ends: 1990 [2024-11-27 20:15:43,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:15:43,616 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 2 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:43,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4237 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-27 20:15:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2024-11-27 20:15:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1990. [2024-11-27 20:15:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1310 states have (on average 1.7458015267175573) internal successors, (2287), 1976 states have internal predecessors, (2287), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2319 transitions. [2024-11-27 20:15:43,647 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2319 transitions. Word has length 60 [2024-11-27 20:15:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:43,647 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 2319 transitions. [2024-11-27 20:15:43,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2319 transitions. [2024-11-27 20:15:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-27 20:15:43,648 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:43,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:43,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:15:43,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:43,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:43,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -474771176, now seen corresponding path program 1 times [2024-11-27 20:15:43,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:43,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748573619] [2024-11-27 20:15:43,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:43,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:43,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:15:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:44,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:15:44,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:44,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:15:44,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:15:44,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:15:44,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-27 20:15:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:44,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:44,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748573619] [2024-11-27 20:15:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748573619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:15:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78202526] [2024-11-27 20:15:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:44,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:15:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:15:44,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:15:44,322 INFO L87 Difference]: Start difference. First operand 1990 states and 2319 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:50,655 INFO L93 Difference]: Finished difference Result 1989 states and 2317 transitions. [2024-11-27 20:15:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:15:50,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2024-11-27 20:15:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:50,661 INFO L225 Difference]: With dead ends: 1989 [2024-11-27 20:15:50,662 INFO L226 Difference]: Without dead ends: 1989 [2024-11-27 20:15:50,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:15:50,663 INFO L435 NwaCegarLoop]: 1643 mSDtfsCounter, 1 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4284 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:50,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4284 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-27 20:15:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-11-27 20:15:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2024-11-27 20:15:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1989 states, 1308 states have (on average 1.746941896024465) internal successors, (2285), 1975 states have internal predecessors, (2285), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-27 20:15:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2317 transitions. [2024-11-27 20:15:50,694 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2317 transitions. Word has length 60 [2024-11-27 20:15:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:50,694 INFO L471 AbstractCegarLoop]: Abstraction has 1989 states and 2317 transitions. [2024-11-27 20:15:50,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:15:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2317 transitions. [2024-11-27 20:15:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:15:50,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:50,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:50,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:15:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:50,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1800596574, now seen corresponding path program 1 times [2024-11-27 20:15:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226460105] [2024-11-27 20:15:50,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:50,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:50,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:50,903 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:50,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:15:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:51,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:15:51,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:51,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:15:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:15:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:51,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:51,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226460105] [2024-11-27 20:15:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226460105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:15:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601556263] [2024-11-27 20:15:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:51,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:15:51,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:51,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:15:51,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:15:51,404 INFO L87 Difference]: Start difference. First operand 1989 states and 2317 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-11-27 20:15:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:57,888 INFO L93 Difference]: Finished difference Result 2007 states and 2348 transitions. [2024-11-27 20:15:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:15:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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 68 [2024-11-27 20:15:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:57,896 INFO L225 Difference]: With dead ends: 2007 [2024-11-27 20:15:57,896 INFO L226 Difference]: Without dead ends: 2007 [2024-11-27 20:15:57,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:15:57,896 INFO L435 NwaCegarLoop]: 1625 mSDtfsCounter, 13 mSDsluCounter, 4334 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5959 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:57,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5959 Invalid, 2281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-27 20:15:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-11-27 20:15:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1998. [2024-11-27 20:15:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1316 states have (on average 1.7446808510638299) internal successors, (2296), 1982 states have internal predecessors, (2296), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2024-11-27 20:15:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2338 transitions. [2024-11-27 20:15:57,923 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2338 transitions. Word has length 68 [2024-11-27 20:15:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:57,924 INFO L471 AbstractCegarLoop]: Abstraction has 1998 states and 2338 transitions. [2024-11-27 20:15:57,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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) [2024-11-27 20:15:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2338 transitions. [2024-11-27 20:15:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:15:57,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:57,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:57,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 20:15:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:58,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:58,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1800596575, now seen corresponding path program 1 times [2024-11-27 20:15:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053233690] [2024-11-27 20:15:58,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:58,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:58,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:58,129 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:58,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 20:15:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:58,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:15:58,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:58,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:15:58,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053233690] [2024-11-27 20:15:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053233690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:15:58,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:15:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:15:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405257651] [2024-11-27 20:15:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:15:58,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:15:58,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:58,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:15:58,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:15:58,478 INFO L87 Difference]: Start difference. First operand 1998 states and 2338 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-11-27 20:15:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:58,588 INFO L93 Difference]: Finished difference Result 1992 states and 2322 transitions. [2024-11-27 20:15:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:15:58,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2024-11-27 20:15:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:58,598 INFO L225 Difference]: With dead ends: 1992 [2024-11-27 20:15:58,598 INFO L226 Difference]: Without dead ends: 1992 [2024-11-27 20:15:58,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:15:58,601 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 0 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:58,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:15:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-27 20:15:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2024-11-27 20:15:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1310 states have (on average 1.7465648854961833) internal successors, (2288), 1978 states have internal predecessors, (2288), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:15:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2322 transitions. [2024-11-27 20:15:58,650 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2322 transitions. Word has length 68 [2024-11-27 20:15:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:58,650 INFO L471 AbstractCegarLoop]: Abstraction has 1992 states and 2322 transitions. [2024-11-27 20:15:58,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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) [2024-11-27 20:15:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2322 transitions. [2024-11-27 20:15:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-27 20:15:58,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:58,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:58,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 20:15:58,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:58,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -90232774, now seen corresponding path program 1 times [2024-11-27 20:15:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746294642] [2024-11-27 20:15:58,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:15:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:58,856 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:58,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 20:15:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:59,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:15:59,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:15:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:59,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:15:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:15:59,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:15:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746294642] [2024-11-27 20:15:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746294642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:15:59,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:15:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 20:15:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809601936] [2024-11-27 20:15:59,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:15:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:15:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:15:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:15:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:15:59,341 INFO L87 Difference]: Start difference. First operand 1992 states and 2322 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:15:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:15:59,614 INFO L93 Difference]: Finished difference Result 2004 states and 2340 transitions. [2024-11-27 20:15:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:15:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-27 20:15:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:15:59,621 INFO L225 Difference]: With dead ends: 2004 [2024-11-27 20:15:59,621 INFO L226 Difference]: Without dead ends: 2004 [2024-11-27 20:15:59,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:15:59,623 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 5 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6550 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:15:59,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6550 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:15:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-27 20:15:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2002. [2024-11-27 20:15:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1319 states have (on average 1.7460197119029568) internal successors, (2303), 1987 states have internal predecessors, (2303), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:15:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2337 transitions. [2024-11-27 20:15:59,682 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2337 transitions. Word has length 69 [2024-11-27 20:15:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:15:59,682 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2337 transitions. [2024-11-27 20:15:59,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:15:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2337 transitions. [2024-11-27 20:15:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-27 20:15:59,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:15:59,685 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:15:59,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-27 20:15:59,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:59,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:15:59,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:15:59,888 INFO L85 PathProgramCache]: Analyzing trace with hash -93256866, now seen corresponding path program 2 times [2024-11-27 20:15:59,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:15:59,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2021132189] [2024-11-27 20:15:59,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:15:59,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:15:59,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:15:59,892 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:15:59,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 20:16:15,228 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:16:15,228 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:16:15,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:16:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:15,432 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:16:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:16:15,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:16:15,771 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:16:15,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:16:15,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:16:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 20:16:15,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:16,044 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:16:16,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:16:16,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:16:16,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021132189] [2024-11-27 20:16:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021132189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:16:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432456885] [2024-11-27 20:16:16,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:16:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:16:16,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:16:16,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-27 20:16:17,690 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:16:17,691 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:16:17,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:16:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:18,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432456885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:16:18,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:16:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-27 20:16:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940898616] [2024-11-27 20:16:18,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:16:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:16:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:16:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:16:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=552, Unknown=7, NotChecked=0, Total=650 [2024-11-27 20:16:18,490 INFO L87 Difference]: Start difference. First operand 2002 states and 2337 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:16:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:40,266 INFO L93 Difference]: Finished difference Result 2018 states and 2359 transitions. [2024-11-27 20:16:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-27 20:16:40,267 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-27 20:16:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:40,271 INFO L225 Difference]: With dead ends: 2018 [2024-11-27 20:16:40,272 INFO L226 Difference]: Without dead ends: 2012 [2024-11-27 20:16:40,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=395, Invalid=2249, Unknown=8, NotChecked=0, Total=2652 [2024-11-27 20:16:40,273 INFO L435 NwaCegarLoop]: 1061 mSDtfsCounter, 1225 mSDsluCounter, 14218 mSDsCounter, 0 mSdLazyCounter, 10038 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 15279 SdHoareTripleChecker+Invalid, 10080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:40,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 15279 Invalid, 10080 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 10038 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2024-11-27 20:16:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-11-27 20:16:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2024-11-27 20:16:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1328 states have (on average 1.7409638554216869) internal successors, (2312), 1995 states have internal predecessors, (2312), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:16:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 2346 transitions. [2024-11-27 20:16:40,322 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 2346 transitions. Word has length 72 [2024-11-27 20:16:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:40,323 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 2346 transitions. [2024-11-27 20:16:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:16:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2346 transitions. [2024-11-27 20:16:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-27 20:16:40,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:40,326 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:40,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 20:16:40,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-27 20:16:40,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:40,727 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:16:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2067819041, now seen corresponding path program 1 times [2024-11-27 20:16:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:16:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321811026] [2024-11-27 20:16:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:40,730 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:40,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 20:16:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:41,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:16:41,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:41,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:16:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:42,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:16:42,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321811026] [2024-11-27 20:16:42,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321811026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:16:42,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:16:42,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-27 20:16:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8608146] [2024-11-27 20:16:42,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:16:42,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:16:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:16:42,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:16:42,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:16:42,159 INFO L87 Difference]: Start difference. First operand 2010 states and 2346 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:16:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:16:44,594 INFO L93 Difference]: Finished difference Result 2034 states and 2385 transitions. [2024-11-27 20:16:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-27 20:16:44,594 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-27 20:16:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:16:44,600 INFO L225 Difference]: With dead ends: 2034 [2024-11-27 20:16:44,600 INFO L226 Difference]: Without dead ends: 2028 [2024-11-27 20:16:44,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-27 20:16:44,602 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 19 mSDsluCounter, 18006 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19647 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:16:44,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 19647 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-27 20:16:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2024-11-27 20:16:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2028. [2024-11-27 20:16:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1346 states have (on average 1.7347696879643388) internal successors, (2335), 2013 states have internal predecessors, (2335), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:16:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2369 transitions. [2024-11-27 20:16:44,635 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2369 transitions. Word has length 78 [2024-11-27 20:16:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:16:44,636 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2369 transitions. [2024-11-27 20:16:44,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:16:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2369 transitions. [2024-11-27 20:16:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:16:44,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:44,637 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:16:44,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-27 20:16:44,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:44,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:16:44,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash -570615073, now seen corresponding path program 2 times [2024-11-27 20:16:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:16:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386377230] [2024-11-27 20:16:44,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:16:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:44,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:44,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 20:17:26,343 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:17:26,343 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:26,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-27 20:17:26,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:26,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:17:26,522 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:17:26,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:17:26,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:17:26,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:17:26,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:17:26,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:17:27,298 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:17:27,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:17:27,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:17:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:17:27,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:17:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-27 20:17:27,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:28,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2024-11-27 20:17:28,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386377230] [2024-11-27 20:17:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386377230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:17:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [914629525] [2024-11-27 20:17:28,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:17:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:17:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:17:28,061 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:17:28,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-27 20:17:29,697 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:17:29,697 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:17:29,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-27 20:17:29,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:31,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [914629525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:17:35,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:17:35,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-27 20:17:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445012541] [2024-11-27 20:17:35,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:17:35,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-27 20:17:35,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:35,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-27 20:17:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-27 20:17:35,045 INFO L87 Difference]: Start difference. First operand 2028 states and 2369 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:18:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:40,517 INFO L93 Difference]: Finished difference Result 2130 states and 2526 transitions. [2024-11-27 20:18:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-11-27 20:18:40,517 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-27 20:18:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:40,525 INFO L225 Difference]: With dead ends: 2130 [2024-11-27 20:18:40,526 INFO L226 Difference]: Without dead ends: 2114 [2024-11-27 20:18:40,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6121 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=5452, Invalid=19357, Unknown=1, NotChecked=312, Total=25122 [2024-11-27 20:18:40,532 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 1248 mSDsluCounter, 29836 mSDsCounter, 0 mSdLazyCounter, 22841 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 30905 SdHoareTripleChecker+Invalid, 22942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 22841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:40,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 30905 Invalid, 22942 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [101 Valid, 22841 Invalid, 0 Unknown, 0 Unchecked, 47.5s Time] [2024-11-27 20:18:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2024-11-27 20:18:40,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2024-11-27 20:18:40,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1432 states have (on average 1.699022346368715) internal successors, (2433), 2098 states have internal predecessors, (2433), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:18:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2467 transitions. [2024-11-27 20:18:40,562 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2467 transitions. Word has length 90 [2024-11-27 20:18:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:40,562 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 2467 transitions. [2024-11-27 20:18:40,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:18:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2467 transitions. [2024-11-27 20:18:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:18:40,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:40,564 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:40,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-27 20:18:40,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-27 20:18:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:18:40,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:18:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 189621371, now seen corresponding path program 1 times [2024-11-27 20:18:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684104476] [2024-11-27 20:18:40,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:40,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:40,968 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:40,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-27 20:18:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:41,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-27 20:18:41,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:41,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:18:41,714 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:18:41,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:18:41,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:42,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:42,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:18:42,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:42,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:18:42,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:18:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:18:42,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:42,359 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:18:42,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:18:42,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem34#1.base|)) is different from false [2024-11-27 20:18:42,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-27 20:18:42,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2207)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-27 20:18:42,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684104476] [2024-11-27 20:18:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684104476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:18:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [905858342] [2024-11-27 20:18:42,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:18:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:18:42,863 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:18:42,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-27 20:18:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:45,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-27 20:18:45,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:45,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:18:45,856 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:18:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:18:45,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:46,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:18:47,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:47,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:18:47,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:47,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:18:47,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:18:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:18:47,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:47,550 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:18:47,972 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2661))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2615)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:18:47,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [905858342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:18:47,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:18:47,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-27 20:18:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441585321] [2024-11-27 20:18:47,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:18:47,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:18:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:47,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:18:47,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=313, Unknown=11, NotChecked=200, Total=600 [2024-11-27 20:18:47,977 INFO L87 Difference]: Start difference. First operand 2114 states and 2467 transitions. Second operand has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:19:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:19:02,027 INFO L93 Difference]: Finished difference Result 2115 states and 2468 transitions. [2024-11-27 20:19:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:19:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-27 20:19:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:19:02,031 INFO L225 Difference]: With dead ends: 2115 [2024-11-27 20:19:02,032 INFO L226 Difference]: Without dead ends: 2115 [2024-11-27 20:19:02,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=344, Unknown=11, NotChecked=210, Total=650 [2024-11-27 20:19:02,033 INFO L435 NwaCegarLoop]: 1063 mSDtfsCounter, 1152 mSDsluCounter, 8387 mSDsCounter, 0 mSdLazyCounter, 7448 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 9450 SdHoareTripleChecker+Invalid, 7479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 7448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:19:02,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 9450 Invalid, 7479 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 7448 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2024-11-27 20:19:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2024-11-27 20:19:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 2113. [2024-11-27 20:19:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1432 states have (on average 1.6976256983240223) internal successors, (2431), 2097 states have internal predecessors, (2431), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:19:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2465 transitions. [2024-11-27 20:19:02,071 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2465 transitions. Word has length 115 [2024-11-27 20:19:02,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:19:02,071 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 2465 transitions. [2024-11-27 20:19:02,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:19:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2465 transitions. [2024-11-27 20:19:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:19:02,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:19:02,074 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:02,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-27 20:19:02,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-27 20:19:02,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:02,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:19:02,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash 189621372, now seen corresponding path program 1 times [2024-11-27 20:19:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:02,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704942552] [2024-11-27 20:19:02,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:02,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:02,478 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:02,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-27 20:19:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:03,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-27 20:19:03,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:03,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:19:03,258 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:19:03,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:19:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:19:03,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:03,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:19:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:19:03,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:04,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:04,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:04,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:04,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:04,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:04,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:19:04,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:19:04,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:04,984 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:05,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-27 20:19:06,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3207) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3208) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3208))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3207) .cse2 v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:19:06,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704942552] [2024-11-27 20:19:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704942552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:19:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449102652] [2024-11-27 20:19:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:06,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:19:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:19:06,645 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:19:06,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-27 20:19:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:10,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-27 20:19:10,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:10,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:19:10,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:19:10,636 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:19:10,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:19:10,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:10,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:19:10,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:19:10,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:11,528 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:11,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:11,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:11,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:11,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:11,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:19:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:19:11,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:11,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3663 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-27 20:19:11,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3663 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-27 20:19:13,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3755))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3754) .cse0 v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3754 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3754) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-27 20:19:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1449102652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:19:13,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:19:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-27 20:19:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916724037] [2024-11-27 20:19:13,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:19:13,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:19:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:13,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:19:13,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-27 20:19:13,204 INFO L87 Difference]: Start difference. First operand 2113 states and 2465 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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) [2024-11-27 20:19:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:19:25,392 INFO L93 Difference]: Finished difference Result 2112 states and 2463 transitions. [2024-11-27 20:19:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:19:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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 115 [2024-11-27 20:19:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:19:25,397 INFO L225 Difference]: With dead ends: 2112 [2024-11-27 20:19:25,397 INFO L226 Difference]: Without dead ends: 2112 [2024-11-27 20:19:25,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-27 20:19:25,398 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 1142 mSDsluCounter, 2736 mSDsCounter, 0 mSdLazyCounter, 4854 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 4864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:19:25,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 3807 Invalid, 4864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4854 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-27 20:19:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2024-11-27 20:19:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2024-11-27 20:19:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1432 states have (on average 1.6962290502793296) internal successors, (2429), 2096 states have internal predecessors, (2429), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:19:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2463 transitions. [2024-11-27 20:19:25,426 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2463 transitions. Word has length 115 [2024-11-27 20:19:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:19:25,426 INFO L471 AbstractCegarLoop]: Abstraction has 2112 states and 2463 transitions. [2024-11-27 20:19:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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) [2024-11-27 20:19:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2463 transitions. [2024-11-27 20:19:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 20:19:25,428 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:19:25,428 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:25,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-27 20:19:25,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-27 20:19:25,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:25,829 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:19:25,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1128584037, now seen corresponding path program 1 times [2024-11-27 20:19:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753678546] [2024-11-27 20:19:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:25,833 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:25,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-27 20:19:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:26,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-27 20:19:26,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:26,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:19:26,648 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:19:26,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:19:26,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:27,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:27,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:27,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:27,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:27,401 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:27,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:27,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:19:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:19:27,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:27,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:19:27,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4177))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:27,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4177))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:28,028 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-27 20:19:28,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2024-11-27 20:19:28,043 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4224 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4177 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4224))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4177)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-27 20:19:28,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:28,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753678546] [2024-11-27 20:19:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753678546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:19:28,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1648802261] [2024-11-27 20:19:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:28,047 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:19:28,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:19:28,049 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:19:28,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-27 20:19:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:31,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-27 20:19:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:31,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:19:31,976 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:19:31,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:19:32,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:19:33,146 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:33,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:33,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:33,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:33,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:33,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:19:33,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:19:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:19:33,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:33,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4648) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-27 20:19:33,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4648) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:19:33,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4647))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4648)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:33,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4647))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4648)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:33,952 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4648 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4694 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4694))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4647)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4648)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:19:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1648802261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:19:33,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:19:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-27 20:19:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036894689] [2024-11-27 20:19:33,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:19:33,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 20:19:33,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:33,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 20:19:33,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=426, Unknown=15, NotChecked=450, Total=992 [2024-11-27 20:19:33,957 INFO L87 Difference]: Start difference. First operand 2112 states and 2463 transitions. Second operand has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:19:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:19:54,117 INFO L93 Difference]: Finished difference Result 2113 states and 2464 transitions. [2024-11-27 20:19:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:19:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-27 20:19:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:19:54,121 INFO L225 Difference]: With dead ends: 2113 [2024-11-27 20:19:54,121 INFO L226 Difference]: Without dead ends: 2113 [2024-11-27 20:19:54,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=549, Unknown=15, NotChecked=504, Total=1190 [2024-11-27 20:19:54,127 INFO L435 NwaCegarLoop]: 1059 mSDtfsCounter, 1139 mSDsluCounter, 10748 mSDsCounter, 0 mSdLazyCounter, 9967 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 11807 SdHoareTripleChecker+Invalid, 9987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 9967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:19:54,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 11807 Invalid, 9987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 9967 Invalid, 0 Unknown, 0 Unchecked, 19.8s Time] [2024-11-27 20:19:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-11-27 20:19:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2024-11-27 20:19:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1432 states have (on average 1.6948324022346368) internal successors, (2427), 2095 states have internal predecessors, (2427), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:19:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2461 transitions. [2024-11-27 20:19:54,175 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2461 transitions. Word has length 118 [2024-11-27 20:19:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:19:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 2461 transitions. [2024-11-27 20:19:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.277777777777778) internal successors, (95), 20 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:19:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2461 transitions. [2024-11-27 20:19:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 20:19:54,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:19:54,178 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:54,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-27 20:19:54,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-27 20:19:54,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:54,579 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:19:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1128584038, now seen corresponding path program 1 times [2024-11-27 20:19:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:54,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1560866165] [2024-11-27 20:19:54,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:54,582 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:54,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-27 20:19:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:55,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-27 20:19:55,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:55,401 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:19:55,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:19:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:19:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:19:55,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:55,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:19:55,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:56,307 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:56,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:56,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:56,417 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-27 20:19:56,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2024-11-27 20:19:56,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:56,621 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-27 20:19:56,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-11-27 20:19:56,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:19:56,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:56,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:19:56,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:19:56,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:56,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-27 20:20:02,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_#t~mem34#1.offset| (_ BitVec 32)) (v_ArrVal_5163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5257))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 (store (select .cse4 .cse0) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem34#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5256) .cse0 v_ArrVal_5163) .cse1 v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((|ULTIMATE.start_main_#t~mem34#1.offset| (_ BitVec 32)) (v_ArrVal_5163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5257))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5256) .cse6 v_ArrVal_5163) (select (select (store .cse7 .cse6 (store (select .cse7 .cse6) (bvadd (_ bv16 32) |ULTIMATE.start_main_#t~mem34#1.offset|) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5164))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-27 20:20:02,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:20:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560866165] [2024-11-27 20:20:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560866165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [472795715] [2024-11-27 20:20:02,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:02,251 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:02,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:20:02,253 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:20:02,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-27 20:20:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:17,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-27 20:20:17,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:17,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:20:17,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:20:17,483 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:20:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:20:17,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:20:17,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:20:17,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:20:17,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:20:19,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:19,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:20:19,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:20:19,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:19,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:20:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:20:19,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:19,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:20:19,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:20:19,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:20:19,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:20:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:20:19,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:19,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:20:20,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:20:20,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5727))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5726) .cse0 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5726) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-27 20:20:20,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5727))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5726) .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5726) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-27 20:20:22,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5820))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5727))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5821) .cse0 v_ArrVal_5726) .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5820))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5821) .cse6 v_ArrVal_5726) (select (select (store .cse7 .cse6 v_ArrVal_5727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5729))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-27 20:20:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [472795715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:22,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:20:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2024-11-27 20:20:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432498168] [2024-11-27 20:20:22,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:20:22,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:20:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:20:22,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:20:22,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=232, Unknown=31, NotChecked=266, Total=600 [2024-11-27 20:20:22,323 INFO L87 Difference]: Start difference. First operand 2111 states and 2461 transitions. Second operand has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 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) [2024-11-27 20:20:28,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:20:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:20:58,550 INFO L93 Difference]: Finished difference Result 2110 states and 2459 transitions. [2024-11-27 20:20:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:20:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 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 118 [2024-11-27 20:20:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:20:58,553 INFO L225 Difference]: With dead ends: 2110 [2024-11-27 20:20:58,553 INFO L226 Difference]: Without dead ends: 2110 [2024-11-27 20:20:58,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=127, Invalid=465, Unknown=36, NotChecked=364, Total=992 [2024-11-27 20:20:58,554 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 1140 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 6878 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 5055 SdHoareTripleChecker+Invalid, 6889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6878 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:20:58,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 5055 Invalid, 6889 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6878 Invalid, 1 Unknown, 0 Unchecked, 35.2s Time] [2024-11-27 20:20:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2024-11-27 20:20:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2110. [2024-11-27 20:20:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 1432 states have (on average 1.693435754189944) internal successors, (2425), 2094 states have internal predecessors, (2425), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:20:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2459 transitions. [2024-11-27 20:20:58,579 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2459 transitions. Word has length 118 [2024-11-27 20:20:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:20:58,579 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 2459 transitions. [2024-11-27 20:20:58,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 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) [2024-11-27 20:20:58,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2459 transitions. [2024-11-27 20:20:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 20:20:58,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:20:58,581 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:58,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-27 20:20:58,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-27 20:20:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:58,982 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:20:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 643374946, now seen corresponding path program 1 times [2024-11-27 20:20:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:20:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771846794] [2024-11-27 20:20:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:58,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:20:58,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:20:58,985 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:20:58,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-27 20:20:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:59,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-27 20:20:59,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:00,135 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:21:00,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:21:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:21:01,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:01,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:01,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:01,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:01,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:01,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:01,951 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:01,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:21:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:21:02,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:02,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6259) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-27 20:21:02,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6259) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-27 20:21:02,170 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6258))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-27 20:21:02,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6258))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-27 20:21:02,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6257))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6258)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:02,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6257))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6258)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:03,004 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-27 20:21:03,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2024-11-27 20:21:03,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6305 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6305))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6257)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6258)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-27 20:21:03,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771846794] [2024-11-27 20:21:03,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771846794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1468139891] [2024-11-27 20:21:03,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:03,044 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:21:03,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:21:03,047 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:21:03,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-27 20:21:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:11,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-27 20:21:11,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:11,508 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:21:11,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:21:11,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:21:11,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:21:14,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:14,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:14,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:14,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:14,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:14,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:14,886 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:14,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:21:14,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:21:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:21:15,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:15,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6745) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-27 20:21:15,137 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-27 20:21:15,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-27 20:21:15,189 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6744))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:15,230 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6743))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:15,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6743))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:15,962 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6791))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6743)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6744)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1468139891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:15,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:21:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-27 20:21:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298983846] [2024-11-27 20:21:15,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:21:15,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 20:21:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:21:15,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 20:21:15,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=474, Unknown=14, NotChecked=798, Total=1406 [2024-11-27 20:21:15,971 INFO L87 Difference]: Start difference. First operand 2110 states and 2459 transitions. Second operand has 23 states, 20 states have (on average 5.2) internal successors, (104), 22 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:22:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:08,345 INFO L93 Difference]: Finished difference Result 2111 states and 2460 transitions. [2024-11-27 20:22:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:22:08,346 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.2) internal successors, (104), 22 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-27 20:22:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:08,348 INFO L225 Difference]: With dead ends: 2111 [2024-11-27 20:22:08,348 INFO L226 Difference]: Without dead ends: 2111 [2024-11-27 20:22:08,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=603, Unknown=14, NotChecked=882, Total=1640 [2024-11-27 20:22:08,349 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 1136 mSDsluCounter, 13002 mSDsCounter, 0 mSdLazyCounter, 12147 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 14060 SdHoareTripleChecker+Invalid, 12169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 12147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:08,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 14060 Invalid, 12169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [22 Valid, 12147 Invalid, 0 Unknown, 0 Unchecked, 51.8s Time] [2024-11-27 20:22:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-11-27 20:22:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2109. [2024-11-27 20:22:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 1432 states have (on average 1.6920391061452513) internal successors, (2423), 2093 states have internal predecessors, (2423), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:22:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2457 transitions. [2024-11-27 20:22:08,374 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2457 transitions. Word has length 121 [2024-11-27 20:22:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:08,374 INFO L471 AbstractCegarLoop]: Abstraction has 2109 states and 2457 transitions. [2024-11-27 20:22:08,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.2) internal successors, (104), 22 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:22:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2457 transitions. [2024-11-27 20:22:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 20:22:08,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:08,376 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:22:08,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-27 20:22:08,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-27 20:22:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:22:08,777 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:22:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 643374947, now seen corresponding path program 1 times [2024-11-27 20:22:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:22:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299176589] [2024-11-27 20:22:08,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:22:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:22:08,781 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:22:08,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-27 20:22:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:09,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-27 20:22:09,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:22:09,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:22:09,969 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:22:09,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:22:10,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:22:10,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:22:10,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:22:10,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:11,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:11,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:12,031 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:12,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:12,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:12,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:12,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:12,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:12,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:12,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:22:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:22:12,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:22:12,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2024-11-27 20:22:12,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:22:12,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7278) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7277))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7278) .cse2 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:22:13,001 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7277))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7278) .cse1 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7278) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-27 20:22:13,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7276))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7277))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7275) .cse0 v_ArrVal_7278) .cse1 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7276))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7275) .cse6 v_ArrVal_7278) (select (select (store .cse7 .cse6 v_ArrVal_7277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7279))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-27 20:22:14,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7276))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7277))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7275) .cse1 v_ArrVal_7278) .cse2 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7276))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7275) .cse7 v_ArrVal_7278) (select (select (store .cse8 .cse7 v_ArrVal_7277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7279))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2024-11-27 20:22:20,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7372))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7371) .cse1 v_ArrVal_7275) .cse2 v_ArrVal_7278) (select (select (store .cse3 .cse2 v_ArrVal_7277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7279))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7372))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7276))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7277))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7371) .cse6 v_ArrVal_7275) .cse7 v_ArrVal_7278) .cse8 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-27 20:22:20,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:22:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299176589] [2024-11-27 20:22:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299176589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:22:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236469427] [2024-11-27 20:22:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:22:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:22:20,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:22:20,183 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:22:20,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-27 20:22:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:37,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-27 20:22:37,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:22:39,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:22:40,070 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:22:40,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:22:40,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:22:40,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:22:40,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:22:40,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:48,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:48,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:48,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:49,780 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:49,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:49,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:50,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:50,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:50,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:51,199 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:51,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:51,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:51,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:22:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:22:51,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:22:52,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-27 20:22:52,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:22:53,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7858) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7859))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7858) .cse3 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-27 20:22:54,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7857))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7859))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7856) .cse0 v_ArrVal_7858) .cse1 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7857))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7856) .cse6 v_ArrVal_7858) (select (select (store .cse7 .cse6 v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7861))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-27 20:22:55,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7857))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7856) .cse2 v_ArrVal_7858) (select (select (store .cse3 .cse2 v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7861))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7857))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_7859))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7856) .cse5 v_ArrVal_7858) .cse6 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-27 20:23:05,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7952))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7857))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7953) .cse1 v_ArrVal_7856) .cse2 v_ArrVal_7858) (select (select (store .cse3 .cse2 v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7861))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7952))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7857))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7859))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7953) .cse6 v_ArrVal_7856) .cse7 v_ArrVal_7858) .cse8 v_ArrVal_7861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7860) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-27 20:23:05,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [236469427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:23:05,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:23:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-27 20:23:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879266172] [2024-11-27 20:23:05,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:23:05,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 20:23:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:05,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 20:23:05,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=177, Unknown=20, NotChecked=494, Total=756 [2024-11-27 20:23:05,404 INFO L87 Difference]: Start difference. First operand 2109 states and 2457 transitions. Second operand has 12 states, 10 states have (on average 7.7) internal successors, (77), 12 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) [2024-11-27 20:25:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:12,602 INFO L93 Difference]: Finished difference Result 2108 states and 2455 transitions. [2024-11-27 20:25:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:25:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.7) internal successors, (77), 12 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 121 [2024-11-27 20:25:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:12,607 INFO L225 Difference]: With dead ends: 2108 [2024-11-27 20:25:12,607 INFO L226 Difference]: Without dead ends: 2108 [2024-11-27 20:25:12,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=111, Invalid=383, Unknown=20, NotChecked=676, Total=1190 [2024-11-27 20:25:12,608 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 1138 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 4862 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 3817 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 123.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:12,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 3817 Invalid, 4872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 4862 Invalid, 0 Unknown, 0 Unchecked, 123.2s Time] [2024-11-27 20:25:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-27 20:25:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2108. [2024-11-27 20:25:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 1432 states have (on average 1.6906424581005586) internal successors, (2421), 2092 states have internal predecessors, (2421), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-27 20:25:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2455 transitions. [2024-11-27 20:25:12,638 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2455 transitions. Word has length 121 [2024-11-27 20:25:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:12,638 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 2455 transitions. [2024-11-27 20:25:12,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.7) internal successors, (77), 12 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) [2024-11-27 20:25:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2455 transitions. [2024-11-27 20:25:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-27 20:25:12,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:12,640 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:12,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-27 20:25:12,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-27 20:25:13,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:25:13,041 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 912 more)] === [2024-11-27 20:25:13,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:13,042 INFO L85 PathProgramCache]: Analyzing trace with hash 212999525, now seen corresponding path program 1 times [2024-11-27 20:25:13,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:25:13,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109689345] [2024-11-27 20:25:13,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:13,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:25:13,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:25:13,044 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:25:13,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-27 20:25:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-27 20:25:13,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:25:16,601 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:25:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:25:16,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:25:17,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:25:17,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:25:18,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:25:18,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:25:32,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:32,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:25:32,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:35,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:35,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:25:35,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:37,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:37,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:25:37,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:39,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:25:39,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:41,139 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:41,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:25:41,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-27 20:25:41,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:25:42,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:25:43,125 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 20:25:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-27 20:25:43,382 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:25:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:25:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:25:44,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:25:50,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:25:50,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8458) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8457))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8458) .cse2 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse3 .cse2 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-27 20:25:51,283 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8458) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8457))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8458) .cse3 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse4 .cse3 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:25:55,166 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8456))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8457))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8455) .cse1 v_ArrVal_8458) .cse2 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse4 .cse2 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8456))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8455) .cse7 v_ArrVal_8458) (select (select (store .cse8 .cse7 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8460))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:26:07,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8454))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8456))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8457))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8453) .cse1 v_ArrVal_8455) .cse2 v_ArrVal_8458) .cse3 v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse5 .cse3 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8454))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_8456))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8453) .cse9 v_ArrVal_8455) .cse10 v_ArrVal_8458) (select (select (store .cse11 .cse10 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8460))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2024-11-27 20:26:19,208 WARN L286 SmtUtils]: Spent 11.37s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-27 20:26:22,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:26:22,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819 [2024-11-27 20:26:29,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8552))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8454))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8456))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8553) .cse1 v_ArrVal_8453) .cse2 v_ArrVal_8455) .cse3 v_ArrVal_8458) (select (select (store .cse4 .cse3 v_ArrVal_8457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_8460))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (_ BitVec 32)) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_39 (_ BitVec 32)) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_40))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_prenex_38))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_prenex_35))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_prenex_34))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_37) .cse8 v_prenex_41) .cse9 v_prenex_36) .cse10 v_prenex_33) .cse11 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| v_prenex_39 v_ArrVal_8461) (select (select (store .cse12 .cse11 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))) (= v_prenex_39 |c_ULTIMATE.start_main_#t~mem32#1.base|))))) is different from false [2024-11-27 20:26:30,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:26:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109689345] [2024-11-27 20:26:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109689345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [47261133] [2024-11-27 20:26:30,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:26:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:26:30,034 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:26:30,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0e28b5-2cf4-4bc9-84ce-34c9d4125c59/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-27 20:26:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:40,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-27 20:26:40,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:40,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:26:47,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:49,669 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:26:49,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:26:53,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:26:53,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:27:03,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2024-11-27 20:27:03,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:00,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:00,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:10,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:10,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:10,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:17,119 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:17,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:17,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:23,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:23,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:24,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:30,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:30,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:31,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:32,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-27 20:28:32,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:37,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:28:37,107 INFO L224 Elim1Store]: Index analysis took 107 ms [2024-11-27 20:28:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:28:38,533 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-27 20:28:38,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-27 20:28:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:28:38,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:28:48,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-27 20:28:49,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:28:51,630 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9059))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9060) .cse0 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse2 .cse0 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9060) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-27 20:28:52,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9060) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9059))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9060) .cse3 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse4 .cse3 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:28:54,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9057))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9059))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9058) .cse0 v_ArrVal_9060) .cse1 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse3 .cse1 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))) (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9057))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9058) .cse6 v_ArrVal_9060) (select (select (store .cse7 .cse6 v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9062))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2024-11-27 20:28:55,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9057))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9058) .cse2 v_ArrVal_9060) (select (select (store .cse3 .cse2 v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9062))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))) (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9059 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_9058 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9057))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9059))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9058) .cse5 v_ArrVal_9060) .cse6 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse7 .cse6 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false