./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:24,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:25,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:29:25,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:25,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:25,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:25,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:25,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:25,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:25,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:25,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:25,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:25,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:25,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:25,131 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:25,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:25,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:25,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:25,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:25,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:25,132 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:29:25,132 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:25,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:25,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:25,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:25,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:25,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:25,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:25,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:25,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:25,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:29:25,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:29:25,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:25,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:25,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:25,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:25,137 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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2024-11-28 03:29:25,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:25,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:25,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:25,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:25,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:25,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-28 03:29:28,752 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/21bd32991/917d59dba6e64588a8d3c5695037e6d0/FLAG7f7b7a1ca [2024-11-28 03:29:29,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:29,297 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-28 03:29:29,329 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/21bd32991/917d59dba6e64588a8d3c5695037e6d0/FLAG7f7b7a1ca [2024-11-28 03:29:29,842 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/21bd32991/917d59dba6e64588a8d3c5695037e6d0 [2024-11-28 03:29:29,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:29,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:29,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:29,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:29,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:29,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:29" (1/1) ... [2024-11-28 03:29:29,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ee82bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:29, skipping insertion in model container [2024-11-28 03:29:29,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:29" (1/1) ... [2024-11-28 03:29:29,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:30,469 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-28 03:29:30,525 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-28 03:29:30,531 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-28 03:29:30,536 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-28 03:29:30,552 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-28 03:29:30,609 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-28 03:29:30,612 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-28 03:29:30,616 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-28 03:29:30,623 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-28 03:29:30,660 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-28 03:29:30,660 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-28 03:29:30,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-28 03:29:30,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-28 03:29:30,666 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-28 03:29:30,669 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-28 03:29:30,671 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-28 03:29:30,672 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-28 03:29:30,673 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-28 03:29:30,678 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-28 03:29:30,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:30,702 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-28 03:29:30,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6fa9a438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:30, skipping insertion in model container [2024-11-28 03:29:30,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:30,703 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-28 03:29:30,705 INFO L158 Benchmark]: Toolchain (without parser) took 856.89ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 67.2MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:29:30,705 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:30,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.15ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 67.2MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:29:30,707 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.15ms. Allocated memory is still 117.4MB. Free memory was 89.6MB in the beginning and 67.2MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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 ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:33,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:33,668 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 03:29:33,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:33,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:33,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:33,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:33,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:33,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:33,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:33,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:33,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:33,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:33,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:33,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:33,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:33,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:33,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:33,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:33,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:29:33,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:29:33,737 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:29:33,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:29:33,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:33,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:33,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:33,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:33,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:33,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:33,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:33,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:33,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:33,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:33,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:33,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:33,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:33,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:33,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:33,741 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:29:33,741 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:29:33,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:33,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:33,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:33,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:33,742 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_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/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 -> ad1bbae792ec9c8e2e546dc04f3672720af98ce14b9bd37d0d7647e79ce45565 [2024-11-28 03:29:34,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:34,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:34,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:34,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:34,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:34,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-28 03:29:37,615 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/a8531371d/2c16f54c61f84b09bcb7f38bd43d132b/FLAG8f857e534 [2024-11-28 03:29:38,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:38,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-2.i [2024-11-28 03:29:38,028 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/a8531371d/2c16f54c61f84b09bcb7f38bd43d132b/FLAG8f857e534 [2024-11-28 03:29:38,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/data/a8531371d/2c16f54c61f84b09bcb7f38bd43d132b [2024-11-28 03:29:38,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:38,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:38,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:38,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:38,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:38,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:38" (1/1) ... [2024-11-28 03:29:38,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baeae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:38, skipping insertion in model container [2024-11-28 03:29:38,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:38" (1/1) ... [2024-11-28 03:29:38,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:38,785 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-28 03:29:38,837 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-28 03:29:38,842 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-28 03:29:38,847 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-28 03:29:38,858 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-28 03:29:38,899 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-28 03:29:38,902 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-28 03:29:38,906 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-28 03:29:38,913 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-28 03:29:38,949 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-28 03:29:38,949 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-28 03:29:38,952 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-28 03:29:38,953 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-28 03:29:38,955 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-28 03:29:38,958 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-28 03:29:38,960 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-28 03:29:38,961 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-28 03:29:38,962 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-28 03:29:38,967 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-28 03:29:38,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:39,001 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-28 03:29:39,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:39,080 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-28 03:29:39,117 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-28 03:29:39,120 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-28 03:29:39,124 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-28 03:29:39,130 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-28 03:29:39,162 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-28 03:29:39,165 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-28 03:29:39,172 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-28 03:29:39,180 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-28 03:29:39,216 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-28 03:29:39,216 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-28 03:29:39,219 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-28 03:29:39,223 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-28 03:29:39,225 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-28 03:29:39,230 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-28 03:29:39,231 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-28 03:29:39,235 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-28 03:29:39,236 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-28 03:29:39,278 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-28 03:29:39,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:39,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:39,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:39,500 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:39,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39 WrapperNode [2024-11-28 03:29:39,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:39,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:39,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:39,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:39,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,651 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1561 [2024-11-28 03:29:39,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:39,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:39,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:39,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:39,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,835 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [2, 371, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 91 writes are split as follows [0, 90, 1]. [2024-11-28 03:29:39,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:39,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:40,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:40,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:40,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:40,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:40,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (1/1) ... [2024-11-28 03:29:40,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:40,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:40,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:29:40,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:29:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 03:29:40,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 03:29:40,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 03:29:40,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 03:29:40,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 03:29:40,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 03:29:40,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 03:29:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 03:29:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 03:29:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 03:29:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 03:29:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 03:29:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-28 03:29:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 03:29:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 03:29:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:29:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:29:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:29:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 03:29:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:40,428 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:40,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:40,456 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:29:40,503 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:29:40,533 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 03:29:48,574 INFO L? ?]: Removed 1704 outVars from TransFormulas that were not future-live. [2024-11-28 03:29:48,575 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:48,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:48,653 INFO L312 CfgBuilder]: Removed 52 assume(true) statements. [2024-11-28 03:29:48,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:48 BoogieIcfgContainer [2024-11-28 03:29:48,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:48,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:48,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:48,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:48,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:38" (1/3) ... [2024-11-28 03:29:48,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3626eb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:48, skipping insertion in model container [2024-11-28 03:29:48,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:39" (2/3) ... [2024-11-28 03:29:48,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3626eb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:48, skipping insertion in model container [2024-11-28 03:29:48,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:48" (3/3) ... [2024-11-28 03:29:48,665 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-2.i [2024-11-28 03:29:48,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:48,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test5-2.i that has 6 procedures, 1654 locations, 1 initial locations, 54 loop locations, and 817 error locations. [2024-11-28 03:29:48,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:48,768 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;@3ba67243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:48,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2024-11-28 03:29:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 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-28 03:29:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:48,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:48,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:48,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:29:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-28 03:29:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:29:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776186321] [2024-11-28 03:29:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:48,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:48,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:48,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:29:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:49,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:29:49,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:49,036 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-28 03:29:49,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:49,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776186321] [2024-11-28 03:29:49,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776186321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:49,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:49,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684513049] [2024-11-28 03:29:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:29:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:49,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:29:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:29:49,077 INFO L87 Difference]: Start difference. First operand has 1644 states, 816 states have (on average 2.221813725490196) internal successors, (1813), 1634 states have internal predecessors, (1813), 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-28 03:29:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:49,167 INFO L93 Difference]: Finished difference Result 1624 states and 1717 transitions. [2024-11-28 03:29:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:29:49,169 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-28 03:29:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:49,188 INFO L225 Difference]: With dead ends: 1624 [2024-11-28 03:29:49,189 INFO L226 Difference]: Without dead ends: 1622 [2024-11-28 03:29:49,190 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-28 03:29:49,193 INFO L435 NwaCegarLoop]: 1717 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, 1717 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-28 03:29:49,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-28 03:29:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2024-11-28 03:29:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 806 states have (on average 2.098014888337469) internal successors, (1691), 1612 states have internal predecessors, (1691), 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-28 03:29:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1715 transitions. [2024-11-28 03:29:49,313 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1715 transitions. Word has length 6 [2024-11-28 03:29:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:49,314 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 1715 transitions. [2024-11-28 03:29:49,314 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-28 03:29:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1715 transitions. [2024-11-28 03:29:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:49,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:49,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:49,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:49,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:49,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:29:49,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-28 03:29:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:29:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301633792] [2024-11-28 03:29:49,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:49,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:49,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:29:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:49,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:29:49,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:49,752 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-28 03:29:49,781 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-28 03:29:49,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:49,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301633792] [2024-11-28 03:29:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301633792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:49,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709612531] [2024-11-28 03:29:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:49,784 INFO L87 Difference]: Start difference. First operand 1622 states and 1715 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-28 03:29:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:53,461 INFO L93 Difference]: Finished difference Result 1759 states and 1884 transitions. [2024-11-28 03:29:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:53,461 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-28 03:29:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:53,469 INFO L225 Difference]: With dead ends: 1759 [2024-11-28 03:29:53,469 INFO L226 Difference]: Without dead ends: 1759 [2024-11-28 03:29:53,469 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-28 03:29:53,470 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 1265 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:53,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1466 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-28 03:29:53,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-28 03:29:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1530. [2024-11-28 03:29:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 806 states have (on average 1.9838709677419355) internal successors, (1599), 1520 states have internal predecessors, (1599), 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-28 03:29:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1623 transitions. [2024-11-28 03:29:53,513 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1623 transitions. Word has length 6 [2024-11-28 03:29:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:53,514 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1623 transitions. [2024-11-28 03:29:53,514 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-28 03:29:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1623 transitions. [2024-11-28 03:29:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:53,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:53,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:53,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:29:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:53,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:29:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-28 03:29:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:29:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550901198] [2024-11-28 03:29:53,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:53,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:53,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:29:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:53,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:29:53,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:53,905 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-28 03:29:53,926 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-28 03:29:53,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:53,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550901198] [2024-11-28 03:29:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550901198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:53,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962965920] [2024-11-28 03:29:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:53,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:53,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:53,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:53,928 INFO L87 Difference]: Start difference. First operand 1530 states and 1623 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-28 03:29:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:59,251 INFO L93 Difference]: Finished difference Result 2077 states and 2221 transitions. [2024-11-28 03:29:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:29:59,252 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-28 03:29:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:59,260 INFO L225 Difference]: With dead ends: 2077 [2024-11-28 03:29:59,260 INFO L226 Difference]: Without dead ends: 2077 [2024-11-28 03:29:59,260 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-28 03:29:59,261 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 769 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:59,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2257 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-28 03:29:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2024-11-28 03:29:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1697. [2024-11-28 03:29:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 983 states have (on average 1.9521871820956256) internal successors, (1919), 1687 states have internal predecessors, (1919), 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-28 03:29:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1943 transitions. [2024-11-28 03:29:59,306 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1943 transitions. Word has length 6 [2024-11-28 03:29:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 1943 transitions. [2024-11-28 03:29:59,306 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-28 03:29:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1943 transitions. [2024-11-28 03:29:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:29:59,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:59,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:29:59,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:59,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:29:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422772, now seen corresponding path program 1 times [2024-11-28 03:29:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:29:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471420851] [2024-11-28 03:29:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:59,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:59,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:29:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:59,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:29:59,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:59,695 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-28 03:29:59,721 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-28 03:29:59,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:59,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471420851] [2024-11-28 03:29:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471420851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:59,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:59,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:29:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917427912] [2024-11-28 03:29:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:59,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:29:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:59,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:29:59,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:29:59,723 INFO L87 Difference]: Start difference. First operand 1697 states and 1943 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-28 03:30:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:04,350 INFO L93 Difference]: Finished difference Result 3012 states and 3472 transitions. [2024-11-28 03:30:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:04,351 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-28 03:30:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:04,361 INFO L225 Difference]: With dead ends: 3012 [2024-11-28 03:30:04,361 INFO L226 Difference]: Without dead ends: 3012 [2024-11-28 03:30:04,361 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-28 03:30:04,362 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1410 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:04,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1707 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 03:30:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2024-11-28 03:30:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2226. [2024-11-28 03:30:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 1513 states have (on average 1.9220092531394581) internal successors, (2908), 2212 states have internal predecessors, (2908), 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-28 03:30:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2940 transitions. [2024-11-28 03:30:04,430 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2940 transitions. Word has length 6 [2024-11-28 03:30:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:04,431 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2940 transitions. [2024-11-28 03:30:04,431 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-28 03:30:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2940 transitions. [2024-11-28 03:30:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:30:04,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:04,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:30:04,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-28 03:30:04,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:04,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:04,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422773, now seen corresponding path program 1 times [2024-11-28 03:30:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:04,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035283882] [2024-11-28 03:30:04,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:04,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:04,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:04,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:30:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:04,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:30:04,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:04,803 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-28 03:30:04,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:04,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035283882] [2024-11-28 03:30:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035283882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:30:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553413007] [2024-11-28 03:30:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:04,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:04,805 INFO L87 Difference]: Start difference. First operand 2226 states and 2940 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-28 03:30:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:04,936 INFO L93 Difference]: Finished difference Result 3884 states and 4992 transitions. [2024-11-28 03:30:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:04,939 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-28 03:30:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:04,953 INFO L225 Difference]: With dead ends: 3884 [2024-11-28 03:30:04,953 INFO L226 Difference]: Without dead ends: 3884 [2024-11-28 03:30:04,953 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-28 03:30:04,954 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 1357 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3208 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.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:04,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3208 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:30:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2024-11-28 03:30:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 2228. [2024-11-28 03:30:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 1515 states have (on average 1.9201320132013202) internal successors, (2909), 2214 states have internal predecessors, (2909), 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-28 03:30:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2941 transitions. [2024-11-28 03:30:05,028 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2941 transitions. Word has length 6 [2024-11-28 03:30:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2941 transitions. [2024-11-28 03:30:05,029 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-28 03:30:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2941 transitions. [2024-11-28 03:30:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 03:30:05,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:05,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:05,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:30:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:05,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-28 03:30:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:05,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159065664] [2024-11-28 03:30:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:05,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:05,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:05,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:05,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:30:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:05,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:30:05,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:05,431 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-28 03:30:05,472 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-28 03:30:05,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:05,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159065664] [2024-11-28 03:30:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159065664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:05,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:30:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551830464] [2024-11-28 03:30:05,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:30:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:05,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:30:05,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:30:05,474 INFO L87 Difference]: Start difference. First operand 2228 states and 2941 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-28 03:30:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:09,684 INFO L93 Difference]: Finished difference Result 2214 states and 2904 transitions. [2024-11-28 03:30:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:30:09,684 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-28 03:30:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:09,689 INFO L225 Difference]: With dead ends: 2214 [2024-11-28 03:30:09,689 INFO L226 Difference]: Without dead ends: 2214 [2024-11-28 03:30:09,689 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-28 03:30:09,690 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 1315 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:09,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1731 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 03:30:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-28 03:30:09,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2205. [2024-11-28 03:30:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1515 states have (on average 1.8897689768976897) internal successors, (2863), 2191 states have internal predecessors, (2863), 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-28 03:30:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2895 transitions. [2024-11-28 03:30:09,747 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2895 transitions. Word has length 12 [2024-11-28 03:30:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 2895 transitions. [2024-11-28 03:30:09,748 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-28 03:30:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2895 transitions. [2024-11-28 03:30:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 03:30:09,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:09,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:09,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:30:09,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:09,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-28 03:30:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628987769] [2024-11-28 03:30:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:09,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:09,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:09,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:09,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:30:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:10,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:30:10,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:10,181 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-28 03:30:10,296 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-28 03:30:10,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:10,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628987769] [2024-11-28 03:30:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628987769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:30:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048513425] [2024-11-28 03:30:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:10,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:30:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:10,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:30:10,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:30:10,299 INFO L87 Difference]: Start difference. First operand 2205 states and 2895 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-28 03:30:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:16,724 INFO L93 Difference]: Finished difference Result 2731 states and 3345 transitions. [2024-11-28 03:30:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:30:16,725 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-28 03:30:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:16,733 INFO L225 Difference]: With dead ends: 2731 [2024-11-28 03:30:16,733 INFO L226 Difference]: Without dead ends: 2731 [2024-11-28 03:30:16,733 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-28 03:30:16,734 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 893 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:16,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2759 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-28 03:30:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2024-11-28 03:30:16,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2321. [2024-11-28 03:30:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1631 states have (on average 1.8412017167381973) internal successors, (3003), 2307 states have internal predecessors, (3003), 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-28 03:30:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3035 transitions. [2024-11-28 03:30:16,799 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3035 transitions. Word has length 12 [2024-11-28 03:30:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:16,799 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3035 transitions. [2024-11-28 03:30:16,799 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-28 03:30:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3035 transitions. [2024-11-28 03:30:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:30:16,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:16,800 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-28 03:30:16,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-28 03:30:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:17,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1395848739, now seen corresponding path program 1 times [2024-11-28 03:30:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830577625] [2024-11-28 03:30:17,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:17,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:17,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:17,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:17,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:30:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:17,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:30:17,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:17,300 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-28 03:30:17,629 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-28 03:30:17,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:30:18,227 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-28 03:30:18,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:18,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830577625] [2024-11-28 03:30:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830577625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:30:18,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:30:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 03:30:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781199396] [2024-11-28 03:30:18,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:30:18,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:30:18,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:18,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:30:18,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:30:18,229 INFO L87 Difference]: Start difference. First operand 2321 states and 3035 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-28 03:30:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:34,305 INFO L93 Difference]: Finished difference Result 3145 states and 3921 transitions. [2024-11-28 03:30:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:30:34,306 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-28 03:30:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:34,313 INFO L225 Difference]: With dead ends: 3145 [2024-11-28 03:30:34,313 INFO L226 Difference]: Without dead ends: 3145 [2024-11-28 03:30:34,313 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-28 03:30:34,314 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 2618 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:34,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 4391 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2024-11-28 03:30:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2024-11-28 03:30:34,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2487. [2024-11-28 03:30:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 1797 states have (on average 1.8013355592654423) internal successors, (3237), 2473 states have internal predecessors, (3237), 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-28 03:30:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3269 transitions. [2024-11-28 03:30:34,382 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3269 transitions. Word has length 31 [2024-11-28 03:30:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:34,382 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3269 transitions. [2024-11-28 03:30:34,382 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-28 03:30:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3269 transitions. [2024-11-28 03:30:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 03:30:34,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:34,384 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-28 03:30:34,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:30:34,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:34,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1652938312, now seen corresponding path program 1 times [2024-11-28 03:30:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813474084] [2024-11-28 03:30:34,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:34,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:34,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:34,592 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:34,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:30:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:34,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:30:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:35,212 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-28 03:30:35,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:35,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:35,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813474084] [2024-11-28 03:30:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813474084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:30:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789061922] [2024-11-28 03:30:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:30:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:35,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:30:35,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:30:35,215 INFO L87 Difference]: Start difference. First operand 2487 states and 3269 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-28 03:30:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:35,470 INFO L93 Difference]: Finished difference Result 2901 states and 3770 transitions. [2024-11-28 03:30:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:30:35,471 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-28 03:30:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:35,477 INFO L225 Difference]: With dead ends: 2901 [2024-11-28 03:30:35,477 INFO L226 Difference]: Without dead ends: 2901 [2024-11-28 03:30:35,478 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-28 03:30:35,478 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 252 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:35,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 3183 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:30:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-11-28 03:30:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2708. [2024-11-28 03:30:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2018 states have (on average 1.7537165510406343) internal successors, (3539), 2694 states have internal predecessors, (3539), 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-28 03:30:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3571 transitions. [2024-11-28 03:30:35,527 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3571 transitions. Word has length 44 [2024-11-28 03:30:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:35,527 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3571 transitions. [2024-11-28 03:30:35,527 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-28 03:30:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3571 transitions. [2024-11-28 03:30:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 03:30:35,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:35,529 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-28 03:30:35,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:30:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:35,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash -994558784, now seen corresponding path program 1 times [2024-11-28 03:30:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2061597056] [2024-11-28 03:30:35,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:35,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:35,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:35,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:35,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:30:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:36,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:30:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:36,149 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-28 03:30:36,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:36,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061597056] [2024-11-28 03:30:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061597056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:36,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:36,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:30:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513332683] [2024-11-28 03:30:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:36,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:30:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:36,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:30:36,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:30:36,150 INFO L87 Difference]: Start difference. First operand 2708 states and 3571 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-28 03:30:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:36,308 INFO L93 Difference]: Finished difference Result 2247 states and 2911 transitions. [2024-11-28 03:30:36,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:30:36,309 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-28 03:30:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:36,323 INFO L225 Difference]: With dead ends: 2247 [2024-11-28 03:30:36,324 INFO L226 Difference]: Without dead ends: 2247 [2024-11-28 03:30:36,324 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-28 03:30:36,324 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 56 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4508 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-28 03:30:36,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4508 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:30:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-28 03:30:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2244. [2024-11-28 03:30:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 1577 states have (on average 1.823715916296766) internal successors, (2876), 2230 states have internal predecessors, (2876), 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-28 03:30:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2908 transitions. [2024-11-28 03:30:36,369 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2908 transitions. Word has length 47 [2024-11-28 03:30:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:36,369 INFO L471 AbstractCegarLoop]: Abstraction has 2244 states and 2908 transitions. [2024-11-28 03:30:36,370 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-28 03:30:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2908 transitions. [2024-11-28 03:30:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 03:30:36,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:36,376 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-28 03:30:36,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:30:36,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:36,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1215894668, now seen corresponding path program 1 times [2024-11-28 03:30:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34416383] [2024-11-28 03:30:36,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:36,581 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:36,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:30:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:36,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:30:36,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:36,964 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-28 03:30:37,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:30:37,697 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-28 03:30:37,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:30:37,727 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-28 03:30:37,739 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-28 03:30:37,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:37,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34416383] [2024-11-28 03:30:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34416383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:30:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723442035] [2024-11-28 03:30:37,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:37,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:30:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:37,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:30:37,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:30:37,742 INFO L87 Difference]: Start difference. First operand 2244 states and 2908 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-28 03:30:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:42,882 INFO L93 Difference]: Finished difference Result 2160 states and 2788 transitions. [2024-11-28 03:30:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:30:42,882 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-28 03:30:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:42,890 INFO L225 Difference]: With dead ends: 2160 [2024-11-28 03:30:42,890 INFO L226 Difference]: Without dead ends: 2160 [2024-11-28 03:30:42,890 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-28 03:30:42,891 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 2354 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2365 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:42,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2365 Valid, 1132 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 03:30:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-28 03:30:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1810. [2024-11-28 03:30:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1227 states have (on average 1.7114914425427872) internal successors, (2100), 1796 states have internal predecessors, (2100), 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-28 03:30:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2132 transitions. [2024-11-28 03:30:42,926 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2132 transitions. Word has length 55 [2024-11-28 03:30:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:42,927 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2132 transitions. [2024-11-28 03:30:42,927 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-28 03:30:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2132 transitions. [2024-11-28 03:30:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 03:30:42,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:42,929 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-28 03:30:42,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 03:30:43,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:43,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash -474771177, now seen corresponding path program 1 times [2024-11-28 03:30:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166972137] [2024-11-28 03:30:43,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:43,134 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:43,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 03:30:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:30:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:43,463 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-28 03:30:43,481 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-28 03:30:43,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-28 03:30:43,538 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-28 03:30:43,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:43,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166972137] [2024-11-28 03:30:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166972137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:30:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673123435] [2024-11-28 03:30:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:43,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:30:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:43,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:30:43,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:30:43,541 INFO L87 Difference]: Start difference. First operand 1810 states and 2132 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-28 03:30:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:47,913 INFO L93 Difference]: Finished difference Result 1809 states and 2130 transitions. [2024-11-28 03:30:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:30:47,913 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-28 03:30:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:47,921 INFO L225 Difference]: With dead ends: 1809 [2024-11-28 03:30:47,921 INFO L226 Difference]: Without dead ends: 1809 [2024-11-28 03:30:47,921 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-28 03:30:47,922 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 2 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3770 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:47,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3770 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 03:30:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-28 03:30:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-28 03:30:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1227 states have (on average 1.7098614506927465) internal successors, (2098), 1795 states have internal predecessors, (2098), 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-28 03:30:47,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2130 transitions. [2024-11-28 03:30:47,957 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2130 transitions. Word has length 60 [2024-11-28 03:30:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2130 transitions. [2024-11-28 03:30:47,958 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-28 03:30:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2130 transitions. [2024-11-28 03:30:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 03:30:47,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:47,959 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-28 03:30:47,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 03:30:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:48,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -474771176, now seen corresponding path program 1 times [2024-11-28 03:30:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181172965] [2024-11-28 03:30:48,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:48,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:48,162 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:48,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 03:30:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:48,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:30:48,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:48,513 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-28 03:30:48,547 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-28 03:30:48,557 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-28 03:30:48,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-28 03:30:48,654 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-28 03:30:48,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:48,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181172965] [2024-11-28 03:30:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181172965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:30:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301590909] [2024-11-28 03:30:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:48,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:30:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:48,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:30:48,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:30:48,656 INFO L87 Difference]: Start difference. First operand 1809 states and 2130 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-28 03:30:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:54,817 INFO L93 Difference]: Finished difference Result 1808 states and 2128 transitions. [2024-11-28 03:30:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:30:54,818 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-28 03:30:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:54,822 INFO L225 Difference]: With dead ends: 1808 [2024-11-28 03:30:54,822 INFO L226 Difference]: Without dead ends: 1808 [2024-11-28 03:30:54,822 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-28 03:30:54,823 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 1 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:54,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3805 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-28 03:30:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-28 03:30:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2024-11-28 03:30:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1225 states have (on average 1.7110204081632654) internal successors, (2096), 1794 states have internal predecessors, (2096), 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-28 03:30:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2128 transitions. [2024-11-28 03:30:54,848 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2128 transitions. Word has length 60 [2024-11-28 03:30:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:54,848 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2128 transitions. [2024-11-28 03:30:54,848 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-28 03:30:54,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2128 transitions. [2024-11-28 03:30:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 03:30:54,853 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:54,853 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-28 03:30:54,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 03:30:55,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:55,054 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:30:55,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:55,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1395509218, now seen corresponding path program 1 times [2024-11-28 03:30:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:55,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1538953346] [2024-11-28 03:30:55,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:30:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:30:55,058 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:30:55,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 03:30:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:55,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:30:55,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:30:55,514 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-28 03:30:55,538 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-28 03:30:55,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:55,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538953346] [2024-11-28 03:30:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538953346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:55,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:55,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:30:55,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962509117] [2024-11-28 03:30:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:30:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:55,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:30:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:30:55,540 INFO L87 Difference]: Start difference. First operand 1808 states and 2128 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-28 03:31:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:00,796 INFO L93 Difference]: Finished difference Result 1826 states and 2159 transitions. [2024-11-28 03:31:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:31:00,797 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-28 03:31:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:00,804 INFO L225 Difference]: With dead ends: 1826 [2024-11-28 03:31:00,804 INFO L226 Difference]: Without dead ends: 1826 [2024-11-28 03:31:00,804 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-28 03:31:00,805 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 13 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:00,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5286 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-28 03:31:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-28 03:31:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-28 03:31:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1233 states have (on average 1.7088402270884022) internal successors, (2107), 1801 states have internal predecessors, (2107), 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-28 03:31:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2149 transitions. [2024-11-28 03:31:00,837 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2149 transitions. Word has length 68 [2024-11-28 03:31:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:00,838 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2149 transitions. [2024-11-28 03:31:00,838 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-28 03:31:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2149 transitions. [2024-11-28 03:31:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 03:31:00,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:00,839 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-28 03:31:00,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 03:31:01,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:01,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:31:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1395509217, now seen corresponding path program 1 times [2024-11-28 03:31:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:31:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628929556] [2024-11-28 03:31:01,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:01,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:01,043 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:01,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 03:31:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:01,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:31:01,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:01,385 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-28 03:31:01,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:31:01,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:31:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628929556] [2024-11-28 03:31:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628929556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:31:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:31:01,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:31:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013329681] [2024-11-28 03:31:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:01,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:31:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:31:01,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:31:01,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:31:01,388 INFO L87 Difference]: Start difference. First operand 1817 states and 2149 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-28 03:31:01,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:01,484 INFO L93 Difference]: Finished difference Result 1811 states and 2133 transitions. [2024-11-28 03:31:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:31:01,485 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-28 03:31:01,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:01,491 INFO L225 Difference]: With dead ends: 1811 [2024-11-28 03:31:01,491 INFO L226 Difference]: Without dead ends: 1811 [2024-11-28 03:31:01,491 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-28 03:31:01,492 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 0 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4351 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-28 03:31:01,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4351 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:31:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-28 03:31:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2024-11-28 03:31:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1227 states have (on average 1.7106764466177669) internal successors, (2099), 1797 states have internal predecessors, (2099), 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-28 03:31:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2133 transitions. [2024-11-28 03:31:01,526 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2133 transitions. Word has length 68 [2024-11-28 03:31:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:01,526 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2133 transitions. [2024-11-28 03:31:01,526 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-28 03:31:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2133 transitions. [2024-11-28 03:31:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 03:31:01,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:01,527 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-28 03:31:01,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 03:31:01,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:01,732 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:31:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash -151107258, now seen corresponding path program 1 times [2024-11-28 03:31:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:31:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027184078] [2024-11-28 03:31:01,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:01,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:01,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:01,736 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:01,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 03:31:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:02,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:31:02,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:02,187 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-28 03:31:02,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:02,291 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-28 03:31:02,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:31:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027184078] [2024-11-28 03:31:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027184078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:31:02,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:31:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 03:31:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46089657] [2024-11-28 03:31:02,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:31:02,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:31:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:31:02,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:31:02,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:31:02,295 INFO L87 Difference]: Start difference. First operand 1811 states and 2133 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-28 03:31:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:02,582 INFO L93 Difference]: Finished difference Result 1823 states and 2151 transitions. [2024-11-28 03:31:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:31:02,583 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-28 03:31:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:02,590 INFO L225 Difference]: With dead ends: 1823 [2024-11-28 03:31:02,590 INFO L226 Difference]: Without dead ends: 1823 [2024-11-28 03:31:02,591 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-28 03:31:02,591 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 8 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5797 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:02,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5797 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:31:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-28 03:31:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1821. [2024-11-28 03:31:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1236 states have (on average 1.7103559870550162) internal successors, (2114), 1806 states have internal predecessors, (2114), 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-28 03:31:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2148 transitions. [2024-11-28 03:31:02,633 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2148 transitions. Word has length 69 [2024-11-28 03:31:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2148 transitions. [2024-11-28 03:31:02,634 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-28 03:31:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2148 transitions. [2024-11-28 03:31:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 03:31:02,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:02,635 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-28 03:31:02,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-28 03:31:02,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:02,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:31:02,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -538885602, now seen corresponding path program 2 times [2024-11-28 03:31:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:31:02,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370625028] [2024-11-28 03:31:02,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:02,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:02,843 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:02,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 03:31:20,154 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:31:20,154 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:31:20,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 03:31:20,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:20,341 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:31:20,342 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-28 03:31:20,372 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-28 03:31:20,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:31:20,639 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-28 03:31:20,700 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-28 03:31:20,738 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-28 03:31:20,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:20,861 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 03:31:20,861 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-28 03:31:20,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:31:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370625028] [2024-11-28 03:31:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370625028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1158348166] [2024-11-28 03:31:20,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:31:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:31:20,956 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:31:20,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-28 03:31:22,585 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:31:22,585 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:31:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 03:31:22,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:22,926 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-28 03:31:22,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:23,403 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-28 03:31:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1158348166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:31:23,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:31:23,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 03:31:23,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402137679] [2024-11-28 03:31:23,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:31:23,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:31:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:31:23,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:31:23,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=553, Unknown=6, NotChecked=0, Total=650 [2024-11-28 03:31:23,405 INFO L87 Difference]: Start difference. First operand 1821 states and 2148 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-28 03:31:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:46,310 INFO L93 Difference]: Finished difference Result 1837 states and 2170 transitions. [2024-11-28 03:31:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 03:31:46,310 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-28 03:31:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:46,314 INFO L225 Difference]: With dead ends: 1837 [2024-11-28 03:31:46,314 INFO L226 Difference]: Without dead ends: 1831 [2024-11-28 03:31:46,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=395, Invalid=2250, Unknown=7, NotChecked=0, Total=2652 [2024-11-28 03:31:46,316 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1223 mSDsluCounter, 11572 mSDsCounter, 0 mSdLazyCounter, 9889 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 9931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 9889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:46,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 12444 Invalid, 9931 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 9889 Invalid, 0 Unknown, 0 Unchecked, 21.4s Time] [2024-11-28 03:31:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-28 03:31:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2024-11-28 03:31:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1245 states have (on average 1.7052208835341365) internal successors, (2123), 1814 states have internal predecessors, (2123), 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-28 03:31:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2157 transitions. [2024-11-28 03:31:46,347 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2157 transitions. Word has length 72 [2024-11-28 03:31:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:46,347 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2157 transitions. [2024-11-28 03:31:46,347 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-28 03:31:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2157 transitions. [2024-11-28 03:31:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 03:31:46,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:46,349 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-28 03:31:46,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 03:31:46,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-28 03:31:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:31:46,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:31:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 132673823, now seen corresponding path program 1 times [2024-11-28 03:31:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:31:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047771311] [2024-11-28 03:31:46,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:31:46,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:46,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:46,753 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:46,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 03:31:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:31:47,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 03:31:47,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:31:47,468 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-28 03:31:47,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:48,382 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-28 03:31:48,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:31:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047771311] [2024-11-28 03:31:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047771311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:31:48,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:31:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 03:31:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726111169] [2024-11-28 03:31:48,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:31:48,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:31:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:31:48,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:31:48,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 03:31:48,385 INFO L87 Difference]: Start difference. First operand 1829 states and 2157 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-28 03:31:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:31:51,103 INFO L93 Difference]: Finished difference Result 1853 states and 2196 transitions. [2024-11-28 03:31:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 03:31:51,104 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-28 03:31:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:31:51,107 INFO L225 Difference]: With dead ends: 1853 [2024-11-28 03:31:51,108 INFO L226 Difference]: Without dead ends: 1847 [2024-11-28 03:31:51,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 03:31:51,109 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 21 mSDsluCounter, 18816 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 20268 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:31:51,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 20268 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 03:31:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-28 03:31:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2024-11-28 03:31:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1263 states have (on average 1.6991290577988916) internal successors, (2146), 1832 states have internal predecessors, (2146), 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-28 03:31:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2180 transitions. [2024-11-28 03:31:51,134 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2180 transitions. Word has length 78 [2024-11-28 03:31:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:31:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2180 transitions. [2024-11-28 03:31:51,134 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-28 03:31:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2180 transitions. [2024-11-28 03:31:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 03:31:51,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:31:51,135 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-28 03:31:51,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 03:31:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:51,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:31:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:31:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2001276703, now seen corresponding path program 2 times [2024-11-28 03:31:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:31:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988256158] [2024-11-28 03:31:51,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:31:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:31:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:31:51,344 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:31:51,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 03:32:15,057 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:32:15,057 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:32:15,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 03:32:15,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:32:15,225 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-28 03:32:15,245 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:32:15,245 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-28 03:32:15,281 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-28 03:32:15,291 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-28 03:32:15,441 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-28 03:32:15,450 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-28 03:32:16,089 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:32:16,090 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-28 03:32:16,105 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-28 03:32:16,156 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-28 03:32:16,162 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-28 03:32:16,198 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-28 03:32:16,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:32:16,881 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-28 03:32:16,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:32:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988256158] [2024-11-28 03:32:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988256158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:32:16,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461013028] [2024-11-28 03:32:16,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:32:16,889 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:32:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:32:16,891 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:32:16,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-28 03:32:18,840 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:32:18,840 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:32:18,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 03:32:18,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:32:20,552 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-28 03:32:20,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:32:24,520 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-28 03:32:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461013028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:32:24,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:32:24,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 03:32:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917160570] [2024-11-28 03:32:24,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:32:24,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 03:32:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:32:24,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 03:32:24,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 03:32:24,523 INFO L87 Difference]: Start difference. First operand 1847 states and 2180 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-28 03:33:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:33:38,189 INFO L93 Difference]: Finished difference Result 1949 states and 2337 transitions. [2024-11-28 03:33:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-11-28 03:33:38,189 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-28 03:33:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:33:38,198 INFO L225 Difference]: With dead ends: 1949 [2024-11-28 03:33:38,198 INFO L226 Difference]: Without dead ends: 1933 [2024-11-28 03:33:38,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6121 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=5452, Invalid=19357, Unknown=1, NotChecked=312, Total=25122 [2024-11-28 03:33:38,205 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1232 mSDsluCounter, 23667 mSDsCounter, 0 mSdLazyCounter, 21706 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 24547 SdHoareTripleChecker+Invalid, 21743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 21706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:33:38,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 24547 Invalid, 21743 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [37 Valid, 21706 Invalid, 0 Unknown, 0 Unchecked, 53.5s Time] [2024-11-28 03:33:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-28 03:33:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1933. [2024-11-28 03:33:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1349 states have (on average 1.6634544106745737) internal successors, (2244), 1917 states have internal predecessors, (2244), 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-28 03:33:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2278 transitions. [2024-11-28 03:33:38,236 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2278 transitions. Word has length 90 [2024-11-28 03:33:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:33:38,237 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2278 transitions. [2024-11-28 03:33:38,237 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-28 03:33:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2278 transitions. [2024-11-28 03:33:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 03:33:38,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:33:38,238 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-28 03:33:38,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-28 03:33:38,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-28 03:33:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:38,640 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:33:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1441534021, now seen corresponding path program 1 times [2024-11-28 03:33:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:33:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845169852] [2024-11-28 03:33:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:38,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:33:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:38,645 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:33:38,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 03:33:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:39,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 03:33:39,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:39,265 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-28 03:33:39,445 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:33:39,446 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-28 03:33:39,474 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-28 03:33:40,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:33:40,284 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-28 03:33:40,393 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:33:40,393 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-28 03:33:40,418 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-28 03:33:40,447 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-28 03:33:40,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:40,553 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (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_2161) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 03:33:41,102 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 03:33:41,102 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 37 treesize of output 36 [2024-11-28 03:33:41,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2207 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2207))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2161)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 03:33:41,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:33:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845169852] [2024-11-28 03:33:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845169852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [84474492] [2024-11-28 03:33:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:41,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:33:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:33:41,118 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:33:41,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-28 03:33:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:44,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 03:33:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:33:44,442 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-28 03:33:44,668 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:33:44,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-28 03:33:44,756 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-28 03:33:44,978 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-28 03:33:46,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:33:46,472 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-28 03:33:46,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:33:46,685 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-28 03:33:46,718 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-28 03:33:46,802 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-28 03:33:46,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:47,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2661 (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_2161)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 03:33:47,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [84474492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:47,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:33:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-28 03:33:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958609698] [2024-11-28 03:33:47,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:33:47,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 03:33:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:33:47,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 03:33:47,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=347, Unknown=9, NotChecked=120, Total=552 [2024-11-28 03:33:47,346 INFO L87 Difference]: Start difference. First operand 1933 states and 2278 transitions. Second operand has 19 states, 16 states have (on average 5.5625) 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-28 03:34:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:03,979 INFO L93 Difference]: Finished difference Result 1934 states and 2279 transitions. [2024-11-28 03:34:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:34:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.5625) 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-28 03:34:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:03,984 INFO L225 Difference]: With dead ends: 1934 [2024-11-28 03:34:03,984 INFO L226 Difference]: Without dead ends: 1934 [2024-11-28 03:34:03,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=97, Invalid=458, Unknown=9, NotChecked=138, Total=702 [2024-11-28 03:34:03,985 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 1146 mSDsluCounter, 7027 mSDsCounter, 0 mSdLazyCounter, 6918 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 7898 SdHoareTripleChecker+Invalid, 6938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:03,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 7898 Invalid, 6938 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6918 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2024-11-28 03:34:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-28 03:34:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1932. [2024-11-28 03:34:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1349 states have (on average 1.6619718309859155) internal successors, (2242), 1916 states have internal predecessors, (2242), 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-28 03:34:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2276 transitions. [2024-11-28 03:34:04,013 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2276 transitions. Word has length 115 [2024-11-28 03:34:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2276 transitions. [2024-11-28 03:34:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.5625) 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-28 03:34:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2276 transitions. [2024-11-28 03:34:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 03:34:04,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:04,015 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-28 03:34:04,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:04,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:04,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:34:04,416 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:34:04,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1441534020, now seen corresponding path program 1 times [2024-11-28 03:34:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:34:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72152004] [2024-11-28 03:34:04,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:04,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:04,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:04,419 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:04,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 03:34:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:05,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 03:34:05,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:05,085 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-28 03:34:05,288 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-28 03:34:05,307 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:34:05,307 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-28 03:34:05,338 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-28 03:34:05,349 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-28 03:34:05,475 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-28 03:34:05,480 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-28 03:34:06,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:06,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-28 03:34:06,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:34:06,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:06,581 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-28 03:34:06,593 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-28 03:34:06,631 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-28 03:34:06,641 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-28 03:34:06,682 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-28 03:34:06,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:06,927 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-28 03:34:06,976 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-28 03:34:08,613 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_3208) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (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_3207))) (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~mem32#1.base| v_ArrVal_3208) .cse2 v_ArrVal_3116) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (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-28 03:34:08,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:34:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72152004] [2024-11-28 03:34:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72152004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122628831] [2024-11-28 03:34:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:34:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:34:08,624 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:34:08,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-28 03:34:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:12,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 03:34:12,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:12,309 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-28 03:34:12,490 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:34:12,491 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-28 03:34:12,501 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-28 03:34:12,515 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-28 03:34:12,527 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-28 03:34:12,596 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-28 03:34:12,601 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-28 03:34:13,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:13,465 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-28 03:34:13,481 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-28 03:34:13,575 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:13,576 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-28 03:34:13,586 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-28 03:34:13,619 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-28 03:34:13,626 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-28 03:34:13,628 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-28 03:34:13,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:13,691 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-28 03:34:13,731 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-28 03:34:15,407 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)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3755) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (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 ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3754))) (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~mem32#1.base| v_ArrVal_3755) .cse2 v_ArrVal_3662) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 03:34:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122628831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:15,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:34:15,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 03:34:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108864476] [2024-11-28 03:34:15,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:15,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:34:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:34:15,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:34:15,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-28 03:34:15,417 INFO L87 Difference]: Start difference. First operand 1932 states and 2276 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-28 03:34:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:32,245 INFO L93 Difference]: Finished difference Result 1931 states and 2274 transitions. [2024-11-28 03:34:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:34:32,246 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-28 03:34:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:32,250 INFO L225 Difference]: With dead ends: 1931 [2024-11-28 03:34:32,250 INFO L226 Difference]: Without dead ends: 1931 [2024-11-28 03:34:32,251 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-28 03:34:32,251 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1142 mSDsluCounter, 3308 mSDsCounter, 0 mSdLazyCounter, 6225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 4190 SdHoareTripleChecker+Invalid, 6235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:32,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 4190 Invalid, 6235 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6225 Invalid, 0 Unknown, 0 Unchecked, 16.5s Time] [2024-11-28 03:34:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-11-28 03:34:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1931. [2024-11-28 03:34:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1349 states have (on average 1.6604892512972573) internal successors, (2240), 1915 states have internal predecessors, (2240), 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-28 03:34:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2274 transitions. [2024-11-28 03:34:32,282 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2274 transitions. Word has length 115 [2024-11-28 03:34:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2274 transitions. [2024-11-28 03:34:32,282 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-28 03:34:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2274 transitions. [2024-11-28 03:34:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 03:34:32,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:32,284 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-28 03:34:32,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:32,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-28 03:34:32,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:32,685 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:34:32,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash 638287909, now seen corresponding path program 1 times [2024-11-28 03:34:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:34:32,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [955167546] [2024-11-28 03:34:32,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:32,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:32,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:32,689 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:32,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-28 03:34:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:33,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-28 03:34:33,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:33,398 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-28 03:34:33,542 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:34:33,542 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-28 03:34:33,561 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-28 03:34:34,162 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:34,163 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-28 03:34:34,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:34,283 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-28 03:34:34,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:34,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-28 03:34:34,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 03:34:34,467 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-28 03:34:34,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:34,593 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-28 03:34:34,610 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-28 03:34:34,621 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-28 03:34:35,154 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 03:34:35,154 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-28 03:34:35,167 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-28 03:34:35,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:34:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955167546] [2024-11-28 03:34:35,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955167546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:35,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1864432526] [2024-11-28 03:34:35,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:35,170 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:34:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:34:35,173 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:34:35,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-28 03:34:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:39,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 03:34:39,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:39,217 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-28 03:34:39,392 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:34:39,392 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-28 03:34:39,449 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-28 03:34:39,637 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-28 03:34:40,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:40,782 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-28 03:34:40,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:40,965 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-28 03:34:41,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:34:41,088 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-28 03:34:41,119 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-28 03:34:41,191 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-28 03:34:41,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:41,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4178 (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_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 03:34:41,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4178 (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_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 03:34:41,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4178 (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_4178)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 03:34:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1864432526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:41,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:34:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-28 03:34:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832094035] [2024-11-28 03:34:41,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:34:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:34:41,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:34:41,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=423, Unknown=14, NotChecked=336, Total=870 [2024-11-28 03:34:41,752 INFO L87 Difference]: Start difference. First operand 1931 states and 2274 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-28 03:34:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:59,853 INFO L93 Difference]: Finished difference Result 1932 states and 2275 transitions. [2024-11-28 03:34:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:34:59,853 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-28 03:34:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:59,859 INFO L225 Difference]: With dead ends: 1932 [2024-11-28 03:34:59,859 INFO L226 Difference]: Without dead ends: 1932 [2024-11-28 03:34:59,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=546, Unknown=14, NotChecked=378, Total=1056 [2024-11-28 03:34:59,864 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 1139 mSDsluCounter, 7744 mSDsCounter, 0 mSdLazyCounter, 7616 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8614 SdHoareTripleChecker+Invalid, 7637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:59,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8614 Invalid, 7637 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 7616 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2024-11-28 03:34:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-28 03:34:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1930. [2024-11-28 03:34:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1349 states have (on average 1.659006671608599) internal successors, (2238), 1914 states have internal predecessors, (2238), 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-28 03:34:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2272 transitions. [2024-11-28 03:34:59,892 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2272 transitions. Word has length 118 [2024-11-28 03:34:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:59,892 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2272 transitions. [2024-11-28 03:34:59,893 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-28 03:34:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2272 transitions. [2024-11-28 03:34:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 03:34:59,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:59,896 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-28 03:34:59,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-28 03:35:00,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-28 03:35:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:35:00,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:35:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 638287910, now seen corresponding path program 1 times [2024-11-28 03:35:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1684977782] [2024-11-28 03:35:00,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:00,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:00,300 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:00,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-28 03:35:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:01,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-28 03:35:01,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:01,243 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:35:01,244 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-28 03:35:01,254 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-28 03:35:01,284 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-28 03:35:01,295 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-28 03:35:01,437 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-28 03:35:01,442 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-28 03:35:02,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:02,335 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-28 03:35:02,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:35:02,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:02,462 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-28 03:35:02,471 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-28 03:35:02,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:02,576 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-28 03:35:02,585 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-28 03:35:02,613 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-28 03:35:02,623 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-28 03:35:02,654 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-28 03:35:02,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:02,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-28 03:35:02,851 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-28 03:35:02,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5163) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5162))) (let ((.cse2 (select (select .cse3 |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_5163) .cse2 v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 03:35:04,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5162 (Array (_ BitVec 32) (_ 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 ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5256))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5257) .cse1 v_ArrVal_5163) (select (select (store .cse2 .cse1 v_ArrVal_5162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5164))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5162 (Array (_ BitVec 32) (_ 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 ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5256))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5162))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5257) .cse4 v_ArrVal_5163) .cse5 v_ArrVal_5164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 03:35:04,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684977782] [2024-11-28 03:35:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684977782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:35:04,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1565578523] [2024-11-28 03:35:04,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:04,995 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:35:04,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:35:04,997 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:35:04,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-28 03:35:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:19,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 03:35:19,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:19,500 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-28 03:35:19,813 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:35:19,814 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-28 03:35:19,831 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-28 03:35:19,868 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-28 03:35:19,883 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-28 03:35:20,005 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-28 03:35:20,014 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-28 03:35:21,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:21,436 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-28 03:35:21,459 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-28 03:35:21,594 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:21,595 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-28 03:35:21,612 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-28 03:35:21,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:21,727 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-28 03:35:21,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:35:21,823 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-28 03:35:21,838 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-28 03:35:21,846 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-28 03:35:21,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:21,938 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-28 03:35:21,976 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-28 03:35:22,053 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-28 03:35:25,748 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-28 03:35:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1565578523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:35:25,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:35:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-28 03:35:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311468679] [2024-11-28 03:35:25,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:35:25,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:35:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:25,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:35:25,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=162, Unknown=20, NotChecked=264, Total=506 [2024-11-28 03:35:25,763 INFO L87 Difference]: Start difference. First operand 1930 states and 2272 transitions. Second operand has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 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-28 03:35:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:55,436 INFO L93 Difference]: Finished difference Result 1929 states and 2270 transitions. [2024-11-28 03:35:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:35:55,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 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 118 [2024-11-28 03:35:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:55,441 INFO L225 Difference]: With dead ends: 1929 [2024-11-28 03:35:55,441 INFO L226 Difference]: Without dead ends: 1929 [2024-11-28 03:35:55,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=108, Invalid=324, Unknown=20, NotChecked=360, Total=812 [2024-11-28 03:35:55,442 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1140 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 6219 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 6229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:55,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4192 Invalid, 6229 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6219 Invalid, 0 Unknown, 0 Unchecked, 29.0s Time] [2024-11-28 03:35:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-28 03:35:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2024-11-28 03:35:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1349 states have (on average 1.6575240919199408) internal successors, (2236), 1913 states have internal predecessors, (2236), 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-28 03:35:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2270 transitions. [2024-11-28 03:35:55,467 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2270 transitions. Word has length 118 [2024-11-28 03:35:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:55,468 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2270 transitions. [2024-11-28 03:35:55,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.555555555555555) internal successors, (77), 11 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-28 03:35:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2270 transitions. [2024-11-28 03:35:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 03:35:55,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:55,470 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-28 03:35:55,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-28 03:35:55,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2024-11-28 03:35:55,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:35:55,871 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:35:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1415199394, now seen corresponding path program 1 times [2024-11-28 03:35:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136339146] [2024-11-28 03:35:55,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:55,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:55,874 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:55,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-28 03:35:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:56,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-28 03:35:56,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:57,040 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:35:57,041 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-28 03:35:57,082 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-28 03:35:57,879 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:57,879 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-28 03:35:58,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:58,058 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-28 03:35:58,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:58,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-28 03:35:58,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:35:58,492 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-28 03:35:58,534 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-28 03:35:58,608 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-28 03:35:58,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:35:58,718 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-28 03:35:58,738 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-28 03:35:58,791 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 03:35:58,791 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 37 treesize of output 36 [2024-11-28 03:35:58,808 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (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)))) is different from false [2024-11-28 03:35:58,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 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) .cse2)))) is different from false [2024-11-28 03:35:58,863 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)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6257)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_6258))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-28 03:35:58,888 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)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (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))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 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) .cse3))))) is different from false [2024-11-28 03:35:59,655 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)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6305))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6257)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_6258))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6259)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 03:35:59,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136339146] [2024-11-28 03:35:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136339146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:35:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1652504455] [2024-11-28 03:35:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:35:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:35:59,666 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:35:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-28 03:36:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:08,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 03:36:08,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:08,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 03:36:08,556 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:36:08,557 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-28 03:36:08,678 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-28 03:36:09,026 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-28 03:36:11,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:11,108 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-28 03:36:11,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:11,448 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-28 03:36:11,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:11,702 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-28 03:36:11,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:11,959 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-28 03:36:12,015 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-28 03:36:12,156 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-28 03:36:12,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:12,192 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-28 03:36:12,210 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-28 03:36:12,238 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-28 03:36:12,257 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-28 03:36:12,298 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-28 03:36:12,327 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-28 03:36:13,041 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-28 03:36:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1652504455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:36:13,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:36:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-28 03:36:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18875335] [2024-11-28 03:36:13,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:36:13,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:36:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:36:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:36:13,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=433, Unknown=14, NotChecked=770, Total=1332 [2024-11-28 03:36:13,049 INFO L87 Difference]: Start difference. First operand 1929 states and 2270 transitions. Second operand has 22 states, 19 states have (on average 5.473684210526316) 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-28 03:36:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:36:46,043 INFO L93 Difference]: Finished difference Result 1930 states and 2271 transitions. [2024-11-28 03:36:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 03:36:46,043 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.473684210526316) 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-28 03:36:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:36:46,047 INFO L225 Difference]: With dead ends: 1930 [2024-11-28 03:36:46,047 INFO L226 Difference]: Without dead ends: 1930 [2024-11-28 03:36:46,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=124, Invalid=470, Unknown=14, NotChecked=798, Total=1406 [2024-11-28 03:36:46,049 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1138 mSDsluCounter, 7886 mSDsCounter, 0 mSdLazyCounter, 7472 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 8758 SdHoareTripleChecker+Invalid, 7491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:36:46,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 8758 Invalid, 7491 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7472 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2024-11-28 03:36:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-28 03:36:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2024-11-28 03:36:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1349 states have (on average 1.6560415122312824) internal successors, (2234), 1912 states have internal predecessors, (2234), 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-28 03:36:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2268 transitions. [2024-11-28 03:36:46,081 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2268 transitions. Word has length 121 [2024-11-28 03:36:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:36:46,081 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2268 transitions. [2024-11-28 03:36:46,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.473684210526316) 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-28 03:36:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2268 transitions. [2024-11-28 03:36:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 03:36:46,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:36:46,087 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-28 03:36:46,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-28 03:36:46,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-28 03:36:46,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:36:46,488 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:36:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1415199395, now seen corresponding path program 1 times [2024-11-28 03:36:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:36:46,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191119819] [2024-11-28 03:36:46,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:36:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:36:46,491 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:36:46,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-28 03:36:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:47,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-28 03:36:47,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:47,337 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-28 03:36:47,696 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:36:47,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-28 03:36:47,718 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-28 03:36:47,777 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-28 03:36:47,785 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-28 03:36:48,039 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-28 03:36:48,048 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-28 03:36:49,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:49,661 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-28 03:36:49,684 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-28 03:36:49,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:49,945 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-28 03:36:49,962 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-28 03:36:50,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:50,174 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-28 03:36:50,193 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-28 03:36:50,409 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:36:50,409 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-28 03:36:50,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:36:50,486 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-28 03:36:50,502 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-28 03:36:50,573 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-28 03:36:50,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:51,089 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-28 03:36:51,218 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-28 03:36:51,276 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-28 03:36:51,708 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-28 03:37:01,278 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-28 03:37:01,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:37:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191119819] [2024-11-28 03:37:01,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191119819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:37:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [73632534] [2024-11-28 03:37:01,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:37:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:37:01,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:37:01,323 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:37:01,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-28 03:37:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:37:18,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 03:37:18,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:37:18,870 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-28 03:37:21,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:37:21,062 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-28 03:37:21,187 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-28 03:37:21,317 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-28 03:37:21,358 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-28 03:37:22,061 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-28 03:37:22,105 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-28 03:37:30,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:37:30,610 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-28 03:37:30,696 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-28 03:37:31,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:37:31,524 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-28 03:37:31,613 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-28 03:37:32,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:37:32,269 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-28 03:37:32,357 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-28 03:37:33,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:37:33,012 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-28 03:37:33,121 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-28 03:37:33,421 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-28 03:37:33,506 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-28 03:37:33,507 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-28 03:37:33,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:37:34,846 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (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_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7859))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7858) .cse0 v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7858) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-28 03:37:35,054 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_7279 (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_7279) |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_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (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_7279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 03:37:35,363 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_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (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_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_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_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_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_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_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-28 03:37:35,637 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_7859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7858 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7857 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7857))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7859))) (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_7856) .cse1 v_ArrVal_7858) .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_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_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7857))) (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_7856) .cse7 v_ArrVal_7858) (select (select (store .cse8 .cse7 v_ArrVal_7859) |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-28 03:37:41,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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_7280 (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_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7952))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7857))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7859))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7953) .cse0 v_ArrVal_7856) .cse1 v_ArrVal_7858) .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_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_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7952))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7857))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7953) .cse8 v_ArrVal_7856) .cse9 v_ArrVal_7858) (select (select (store .cse10 .cse9 v_ArrVal_7859) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7279))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-28 03:37:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [73632534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:37:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:37:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-28 03:37:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784454427] [2024-11-28 03:37:41,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:37:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:37:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:37:41,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:37:41,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=189, Unknown=25, NotChecked=370, Total=650 [2024-11-28 03:37:41,589 INFO L87 Difference]: Start difference. First operand 1928 states and 2268 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-28 03:39:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:39:21,841 INFO L93 Difference]: Finished difference Result 1927 states and 2266 transitions. [2024-11-28 03:39:21,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:39:21,841 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-28 03:39:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:39:21,845 INFO L225 Difference]: With dead ends: 1927 [2024-11-28 03:39:21,845 INFO L226 Difference]: Without dead ends: 1927 [2024-11-28 03:39:21,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=118, Invalid=401, Unknown=27, NotChecked=510, Total=1056 [2024-11-28 03:39:21,846 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1138 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 4405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:39:21,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 3150 Invalid, 4405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 96.4s Time] [2024-11-28 03:39:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-11-28 03:39:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927. [2024-11-28 03:39:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1349 states have (on average 1.6545589325426242) internal successors, (2232), 1911 states have internal predecessors, (2232), 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-28 03:39:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2266 transitions. [2024-11-28 03:39:21,871 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2266 transitions. Word has length 121 [2024-11-28 03:39:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:39:21,872 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2266 transitions. [2024-11-28 03:39:21,872 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-28 03:39:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2266 transitions. [2024-11-28 03:39:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 03:39:21,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:39:21,874 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-28 03:39:21,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-28 03:39:22,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2024-11-28 03:39:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:39:22,274 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 814 more)] === [2024-11-28 03:39:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:39:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash -768370523, now seen corresponding path program 1 times [2024-11-28 03:39:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:39:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136422156] [2024-11-28 03:39:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:39:22,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:39:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:39:22,277 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:39:22,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-28 03:39:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:39:23,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-28 03:39:23,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:39:25,299 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-28 03:39:25,528 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:39:25,529 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-28 03:39:25,916 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-28 03:39:26,004 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-28 03:39:27,309 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-28 03:39:27,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:39:38,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:39:38,658 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-28 03:39:38,745 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-28 03:39:40,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:39:40,689 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-28 03:39:40,779 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-28 03:39:42,289 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:39:42,289 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-28 03:39:42,378 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-28 03:39:44,051 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:39:44,051 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-28 03:39:44,145 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-28 03:39:45,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:39:45,740 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-28 03:39:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 03:39:46,353 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-28 03:39:46,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-28 03:39:47,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:39:47,460 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 03:39:47,461 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-28 03:39:47,693 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 03:39:47,694 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-28 03:39:48,323 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-28 03:39:48,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:39:52,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (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| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (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_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (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)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (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-28 03:39:52,721 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-28 03:39:53,261 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-28 03:39:53,555 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-28 03:39:54,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (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))) (v_ArrVal_8456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8456))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8455) .cse1 v_ArrVal_8458) (select (select (store .cse2 .cse1 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 .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_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 ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8456))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8457))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8455) .cse4 v_ArrVal_8458) .cse5 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 .cse6 .cse5 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|))))))) is different from false [2024-11-28 03:39:54,420 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-28 03:39:55,085 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (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))) (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 ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8454))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8456))) (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~mem34#1.base| v_ArrVal_8453) .cse1 v_ArrVal_8455) .cse2 v_ArrVal_8458) (select (select (store .cse3 .cse2 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 .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_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 (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8461 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8454))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8456))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8457))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8453) .cse6 v_ArrVal_8455) .cse7 v_ArrVal_8458) .cse8 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 .cse9 .cse8 v_ArrVal_8459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) is different from false [2024-11-28 03:39:55,479 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-28 03:40:00,916 WARN L286 SmtUtils]: Spent 5.15s 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-28 03:40:02,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:40:02,294 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-28 03:40:07,958 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-28 03:40:08,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:40:08,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136422156] [2024-11-28 03:40:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136422156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:40:08,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [862790526] [2024-11-28 03:40:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:40:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:40:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:40:08,037 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:40:08,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d4539f2-a6e8-4528-9c29-b41bcf85e6fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-28 03:40:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:40:18,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-28 03:40:18,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:40:18,316 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-28 03:40:22,970 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-28 03:40:24,079 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:40:24,079 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-28 03:40:26,140 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-28 03:40:26,326 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-28 03:40:32,007 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-28 03:40:32,106 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-28 03:41:10,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:41:10,132 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-28 03:41:10,351 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-28 03:41:17,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:41:17,006 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-28 03:41:17,294 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-28 03:41:21,468 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:41:21,468 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-28 03:41:21,659 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-28 03:41:25,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:41:25,773 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-28 03:41:25,960 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-28 03:41:30,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 03:41:30,002 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-28 03:41:30,186 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-28 03:41:31,109 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-28 03:41:31,205 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-28 03:41:33,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:41:33,802 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-28 03:41:34,860 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-28 03:41:34,860 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-28 03:41:34,864 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-28 03:41:34,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:41:39,273 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-28 03:41:39,933 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-28 03:41:41,140 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-28 03:41:41,765 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-28 03:41:46,869 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-28 03:41:47,477 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 [2024-11-28 03:41:48,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9056))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9057))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9059))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9055) .cse0 v_ArrVal_9058) .cse1 v_ArrVal_9060) .cse2 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse4 .cse2 v_ArrVal_9061) |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_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_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9056))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9057))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9055) .cse8 v_ArrVal_9058) .cse9 v_ArrVal_9060) (select (select (store .cse10 .cse9 v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9062))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd .cse7 (_ bv4 32)))))))) is different from false [2024-11-28 03:41:54,717 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_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9056))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9057))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9059))) (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_9055) .cse1 v_ArrVal_9058) .cse2 v_ArrVal_9060) .cse3 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 .cse5 .cse3 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|))))) (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_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9056))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_9057))) (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_9055) .cse9 v_ArrVal_9058) .cse10 v_ArrVal_9060) (select (select (store .cse11 .cse10 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 .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2024-11-28 03:42:10,214 WARN L286 SmtUtils]: Spent 14.52s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-28 03:42:13,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_9057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9154))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9056))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_9057))) (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_9155) .cse1 v_ArrVal_9055) .cse2 v_ArrVal_9058) .cse3 v_ArrVal_9060) (select (select (store .cse4 .cse3 v_ArrVal_9059) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_9062))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (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_9155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9154 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9055 (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 ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9154))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_9056))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_9057))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_9059))) (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_ArrVal_9155) .cse8 v_ArrVal_9055) .cse9 v_ArrVal_9058) .cse10 v_ArrVal_9060) .cse11 v_ArrVal_9062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8461) (select (select (store .cse12 .cse11 v_ArrVal_9061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-28 03:42:13,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [862790526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:42:13,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:42:13,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2024-11-28 03:42:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143262069] [2024-11-28 03:42:13,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:42:13,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 03:42:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:42:13,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 03:42:13,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=712, Unknown=18, NotChecked=1278, Total=2162 [2024-11-28 03:42:13,349 INFO L87 Difference]: Start difference. First operand 1927 states and 2266 transitions. Second operand has 26 states, 23 states have (on average 4.826086956521739) internal successors, (111), 25 states have internal predecessors, (111), 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)