./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:16:36,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:16:36,602 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-27 20:16:36,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:16:36,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:16:36,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:16:36,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:16:36,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:16:36,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:16:36,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:16:36,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:16:36,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:16:36,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:16:36,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:16:36,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:16:36,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:16:36,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:16:36,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:16:36,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:16:36,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:16:36,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:36,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:36,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:36,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:16:36,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:16:36,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:16:36,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:16:36,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:16:36,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:16:36,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:16:36,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:16:36,652 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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2024-11-27 20:16:37,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:16:37,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:16:37,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:16:37,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:16:37,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:16:37,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2024-11-27 20:16:40,823 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/e6e4465ad/2e53443930b24d96967b46ca1dac2f09/FLAGbc31f12ee [2024-11-27 20:16:41,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:16:41,411 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2024-11-27 20:16:41,444 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/e6e4465ad/2e53443930b24d96967b46ca1dac2f09/FLAGbc31f12ee [2024-11-27 20:16:41,477 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/e6e4465ad/2e53443930b24d96967b46ca1dac2f09 [2024-11-27 20:16:41,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:16:41,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:16:41,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:41,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:16:41,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:16:41,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:41" (1/1) ... [2024-11-27 20:16:41,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6b4d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:41, skipping insertion in model container [2024-11-27 20:16:41,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:41" (1/1) ... [2024-11-27 20:16:41,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:16:42,218 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,287 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,294 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,299 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,308 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,349 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,352 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,356 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,363 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,401 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,401 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,405 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,405 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,408 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,411 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,413 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,414 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,415 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,420 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:42,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:42,464 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-27 20:16:42,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cd66d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:42, skipping insertion in model container [2024-11-27 20:16:42,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:42,466 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-27 20:16:42,469 INFO L158 Benchmark]: Toolchain (without parser) took 986.06ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 79.8MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:16:42,471 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:16:42,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 980.33ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 79.8MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:16:42,475 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.51ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 980.33ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 79.8MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. 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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:16:45,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:16:45,171 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-27 20:16:45,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:16:45,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:16:45,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:16:45,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:16:45,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:16:45,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:16:45,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:16:45,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:16:45,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:16:45,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:16:45,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:16:45,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:16:45,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:16:45,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:16:45,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:45,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:45,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:45,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:45,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:16:45,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:16:45,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:16:45,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:16:45,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:45,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:16:45,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:16:45,220 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:16:45,220 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:16:45,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:16:45,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:16:45,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:16:45,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:16:45,221 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_6f62084d-fd16-4d02-b367-0fd1bb01cae4/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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2024-11-27 20:16:45,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:16:45,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:16:45,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:16:45,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:16:45,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:16:45,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2024-11-27 20:16:48,573 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/14fb30d1e/89cc9c59a49e4af0853521d74d920a01/FLAGa88086d47 [2024-11-27 20:16:49,015 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:16:49,016 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2024-11-27 20:16:49,042 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/14fb30d1e/89cc9c59a49e4af0853521d74d920a01/FLAGa88086d47 [2024-11-27 20:16:49,059 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/data/14fb30d1e/89cc9c59a49e4af0853521d74d920a01 [2024-11-27 20:16:49,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:16:49,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:16:49,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:49,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:16:49,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:16:49,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:49" (1/1) ... [2024-11-27 20:16:49,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e146322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:49, skipping insertion in model container [2024-11-27 20:16:49,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:16:49" (1/1) ... [2024-11-27 20:16:49,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:16:49,738 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,779 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,784 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,790 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,802 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,849 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,853 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,857 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,866 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,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-27 20:16:49,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-27 20:16:49,921 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,921 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,928 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,936 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,937 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,942 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,943 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,956 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:49,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:49,999 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-27 20:16:50,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:16:50,055 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,074 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,076 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,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-27 20:16:50,086 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,113 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,115 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,119 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,125 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,153 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,153 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,156 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,156 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,158 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,161 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,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-27 20:16:50,163 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,164 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,168 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 20:16:50,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:50,178 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:16:50,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:16:50,378 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:16:50,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50 WrapperNode [2024-11-27 20:16:50,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:16:50,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:50,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:16:50,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:16:50,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,559 INFO L138 Inliner]: procedures = 180, calls = 426, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1561 [2024-11-27 20:16:50,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:16:50,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:16:50,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:16:50,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:16:50,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,793 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [371, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 91 writes are split as follows [90, 0, 1]. [2024-11-27 20:16:50,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:16:50,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:16:50,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:16:50,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:16:50,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (1/1) ... [2024-11-27 20:16:50,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:16:51,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:51,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:16:51,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:16:51,067 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-27 20:16:51,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-27 20:16:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-27 20:16:51,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-27 20:16:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-27 20:16:51,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-27 20:16:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-27 20:16:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-27 20:16:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-27 20:16:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-27 20:16:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-27 20:16:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-27 20:16:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-27 20:16:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-27 20:16:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-27 20:16:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:16:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-27 20:16:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-27 20:16:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-27 20:16:51,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-27 20:16:51,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:16:51,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:16:51,411 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:16:51,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:16:51,444 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:16:51,498 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:16:51,531 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-27 20:16:59,230 INFO L? ?]: Removed 1704 outVars from TransFormulas that were not future-live. [2024-11-27 20:16:59,230 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:16:59,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:16:59,313 INFO L312 CfgBuilder]: Removed 52 assume(true) statements. [2024-11-27 20:16:59,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:59 BoogieIcfgContainer [2024-11-27 20:16:59,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:16:59,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:16:59,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:16:59,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:16:59,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:16:49" (1/3) ... [2024-11-27 20:16:59,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd1da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:59, skipping insertion in model container [2024-11-27 20:16:59,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:16:50" (2/3) ... [2024-11-27 20:16:59,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbd1da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:16:59, skipping insertion in model container [2024-11-27 20:16:59,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:16:59" (3/3) ... [2024-11-27 20:16:59,331 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-2.i [2024-11-27 20:16:59,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:16:59,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test5-2.i that has 6 procedures, 1654 locations, 1 initial locations, 54 loop locations, and 817 error locations. [2024-11-27 20:16:59,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:16:59,458 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;@5e9d214b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:16:59,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 817 error locations. [2024-11-27 20:16:59,472 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-27 20:16:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:16:59,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:16:59,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:16:59,478 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-27 20:16:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:16:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2009152842, now seen corresponding path program 1 times [2024-11-27 20:16:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:16:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100121366] [2024-11-27 20:16:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:16:59,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:16:59,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:16:59,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:16:59,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:16:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:16:59,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-27 20:16:59,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:16:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:16:59,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:16:59,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:16:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100121366] [2024-11-27 20:16:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100121366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:16:59,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:16:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:16:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201671215] [2024-11-27 20:16:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:16:59,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-27 20:16:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:16:59,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-27 20:16:59,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:16:59,902 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-27 20:17:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:00,042 INFO L93 Difference]: Finished difference Result 1624 states and 1717 transitions. [2024-11-27 20:17:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-27 20:17:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:17:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:00,075 INFO L225 Difference]: With dead ends: 1624 [2024-11-27 20:17:00,076 INFO L226 Difference]: Without dead ends: 1622 [2024-11-27 20:17:00,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-27 20:17:00,081 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-27 20:17:00,081 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-27 20:17:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-27 20:17:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2024-11-27 20:17:00,191 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-27 20:17:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1715 transitions. [2024-11-27 20:17:00,204 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1715 transitions. Word has length 6 [2024-11-27 20:17:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:00,205 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 1715 transitions. [2024-11-27 20:17:00,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1715 transitions. [2024-11-27 20:17:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:17:00,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:00,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:17:00,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:17:00,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:00,411 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-27 20:17:00,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605546, now seen corresponding path program 1 times [2024-11-27 20:17:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126994161] [2024-11-27 20:17:00,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:00,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:00,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:00,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:00,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:17:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:00,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:17:00,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:00,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:17:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:00,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:00,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126994161] [2024-11-27 20:17:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126994161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:17:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928232160] [2024-11-27 20:17:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:00,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:00,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:00,722 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-27 20:17:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:04,633 INFO L93 Difference]: Finished difference Result 1759 states and 1884 transitions. [2024-11-27 20:17:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:17:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:04,640 INFO L225 Difference]: With dead ends: 1759 [2024-11-27 20:17:04,640 INFO L226 Difference]: Without dead ends: 1759 [2024-11-27 20:17:04,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:04,641 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 1265 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:04,642 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.8s Time] [2024-11-27 20:17:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-27 20:17:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1530. [2024-11-27 20:17:04,713 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-27 20:17:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1623 transitions. [2024-11-27 20:17:04,722 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1623 transitions. Word has length 6 [2024-11-27 20:17:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:04,723 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1623 transitions. [2024-11-27 20:17:04,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1623 transitions. [2024-11-27 20:17:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:17:04,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:04,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:17:04,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:17:04,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:04,924 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-27 20:17:04,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1954605547, now seen corresponding path program 1 times [2024-11-27 20:17:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:04,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020337492] [2024-11-27 20:17:04,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:04,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:04,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:04,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:17:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:05,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:17:05,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:05,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:17:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:05,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:05,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020337492] [2024-11-27 20:17:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020337492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:17:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504158183] [2024-11-27 20:17:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:05,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:05,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:05,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:05,139 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-27 20:17:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:11,196 INFO L93 Difference]: Finished difference Result 2077 states and 2221 transitions. [2024-11-27 20:17:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:17:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:11,209 INFO L225 Difference]: With dead ends: 2077 [2024-11-27 20:17:11,210 INFO L226 Difference]: Without dead ends: 2077 [2024-11-27 20:17:11,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:11,215 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 769 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:11,216 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.9s Time] [2024-11-27 20:17:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2024-11-27 20:17:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1697. [2024-11-27 20:17:11,295 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-27 20:17:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1943 transitions. [2024-11-27 20:17:11,302 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1943 transitions. Word has length 6 [2024-11-27 20:17:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:11,302 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 1943 transitions. [2024-11-27 20:17:11,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1943 transitions. [2024-11-27 20:17:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:17:11,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:11,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:17:11,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:11,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:11,504 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-27 20:17:11,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422772, now seen corresponding path program 1 times [2024-11-27 20:17:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964438621] [2024-11-27 20:17:11,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:11,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:11,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:11,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:11,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:17:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:11,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:17:11,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:17:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:11,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:11,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964438621] [2024-11-27 20:17:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964438621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:11,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:17:11,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220060520] [2024-11-27 20:17:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:11,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:11,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:11,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:11,740 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-27 20:17:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:17,356 INFO L93 Difference]: Finished difference Result 3012 states and 3472 transitions. [2024-11-27 20:17:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:17:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:17,367 INFO L225 Difference]: With dead ends: 3012 [2024-11-27 20:17:17,367 INFO L226 Difference]: Without dead ends: 3012 [2024-11-27 20:17:17,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:17,369 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 1410 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 5.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:17,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1707 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-27 20:17:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2024-11-27 20:17:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2226. [2024-11-27 20:17:17,481 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-27 20:17:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2940 transitions. [2024-11-27 20:17:17,494 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2940 transitions. Word has length 6 [2024-11-27 20:17:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:17,494 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 2940 transitions. [2024-11-27 20:17:17,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2940 transitions. [2024-11-27 20:17:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 20:17:17,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:17,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 20:17:17,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:17:17,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:17,695 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-27 20:17:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1956422773, now seen corresponding path program 1 times [2024-11-27 20:17:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456247592] [2024-11-27 20:17:17,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:17,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:17,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:17,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:17,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:17:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:17,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:17:17,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:17,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:17,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456247592] [2024-11-27 20:17:17,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456247592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:17,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:17,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:17,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901527445] [2024-11-27 20:17:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:17,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:17,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:17,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:17,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:17,935 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-27 20:17:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:18,128 INFO L93 Difference]: Finished difference Result 3884 states and 4992 transitions. [2024-11-27 20:17:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 20:17:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:18,150 INFO L225 Difference]: With dead ends: 3884 [2024-11-27 20:17:18,151 INFO L226 Difference]: Without dead ends: 3884 [2024-11-27 20:17:18,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:18,152 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.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:18,152 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.2s Time] [2024-11-27 20:17:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2024-11-27 20:17:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 2228. [2024-11-27 20:17:18,218 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-27 20:17:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2941 transitions. [2024-11-27 20:17:18,227 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2941 transitions. Word has length 6 [2024-11-27 20:17:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:18,228 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2941 transitions. [2024-11-27 20:17:18,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2941 transitions. [2024-11-27 20:17:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:17:18,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:18,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:18,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 20:17:18,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:18,434 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-27 20:17:18,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 748226775, now seen corresponding path program 1 times [2024-11-27 20:17:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:18,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083507446] [2024-11-27 20:17:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:18,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:18,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:18,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:18,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:17:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:18,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:17:18,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:18,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:17:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:18,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:18,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083507446] [2024-11-27 20:17:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083507446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697547433] [2024-11-27 20:17:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:18,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:17:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:17:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:17:18,757 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-27 20:17:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:23,976 INFO L93 Difference]: Finished difference Result 2214 states and 2904 transitions. [2024-11-27 20:17:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:17:23,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-27 20:17:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:23,982 INFO L225 Difference]: With dead ends: 2214 [2024-11-27 20:17:23,982 INFO L226 Difference]: Without dead ends: 2214 [2024-11-27 20:17:23,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:17:23,983 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 1315 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 5.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:23,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1731 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-27 20:17:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-27 20:17:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2205. [2024-11-27 20:17:24,041 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-27 20:17:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2895 transitions. [2024-11-27 20:17:24,049 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2895 transitions. Word has length 12 [2024-11-27 20:17:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:24,050 INFO L471 AbstractCegarLoop]: Abstraction has 2205 states and 2895 transitions. [2024-11-27 20:17:24,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2895 transitions. [2024-11-27 20:17:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-27 20:17:24,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:24,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:24,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:17:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:24,252 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-27 20:17:24,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash 748226776, now seen corresponding path program 1 times [2024-11-27 20:17:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886638397] [2024-11-27 20:17:24,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:24,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:24,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:24,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:17:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:24,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:17:24,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:24,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:17:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:24,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:24,666 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:24,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886638397] [2024-11-27 20:17:24,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886638397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:24,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:24,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180026268] [2024-11-27 20:17:24,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:24,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:17:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:24,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:17:24,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:17:24,669 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-27 20:17:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:32,324 INFO L93 Difference]: Finished difference Result 2731 states and 3345 transitions. [2024-11-27 20:17:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:17:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-27 20:17:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:32,335 INFO L225 Difference]: With dead ends: 2731 [2024-11-27 20:17:32,336 INFO L226 Difference]: Without dead ends: 2731 [2024-11-27 20:17:32,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:17:32,337 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 893 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s 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, 7.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:32,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2759 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-27 20:17:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2024-11-27 20:17:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2321. [2024-11-27 20:17:32,397 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-27 20:17:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3035 transitions. [2024-11-27 20:17:32,412 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3035 transitions. Word has length 12 [2024-11-27 20:17:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3035 transitions. [2024-11-27 20:17:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:32,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3035 transitions. [2024-11-27 20:17:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-27 20:17:32,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:32,414 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:32,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 20:17:32,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:32,615 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-27 20:17:32,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1395848739, now seen corresponding path program 1 times [2024-11-27 20:17:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:32,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365148011] [2024-11-27 20:17:32,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:32,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:32,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:17:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:32,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:17:32,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:32,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:17:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:33,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:17:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:34,158 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365148011] [2024-11-27 20:17:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365148011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:17:34,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:17:34,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-27 20:17:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982569290] [2024-11-27 20:17:34,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:17:34,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:17:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:34,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:17:34,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:17:34,160 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-27 20:17:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:52,202 INFO L93 Difference]: Finished difference Result 3145 states and 3921 transitions. [2024-11-27 20:17:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:17:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-27 20:17:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:52,210 INFO L225 Difference]: With dead ends: 3145 [2024-11-27 20:17:52,210 INFO L226 Difference]: Without dead ends: 3145 [2024-11-27 20:17:52,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:17:52,211 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 2618 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:52,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 4391 Invalid, 3619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 17.7s Time] [2024-11-27 20:17:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2024-11-27 20:17:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2487. [2024-11-27 20:17:52,261 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-27 20:17:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3269 transitions. [2024-11-27 20:17:52,268 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3269 transitions. Word has length 31 [2024-11-27 20:17:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3269 transitions. [2024-11-27 20:17:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3269 transitions. [2024-11-27 20:17:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-27 20:17:52,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:52,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:52,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 20:17:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:52,475 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-27 20:17:52,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:52,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1652938312, now seen corresponding path program 1 times [2024-11-27 20:17:52,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8629798] [2024-11-27 20:17:52,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:52,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:52,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:17:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:52,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:17:52,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:53,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:53,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8629798] [2024-11-27 20:17:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8629798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:53,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141253700] [2024-11-27 20:17:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:17:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:53,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:17:53,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:53,187 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-27 20:17:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:53,528 INFO L93 Difference]: Finished difference Result 2901 states and 3770 transitions. [2024-11-27 20:17:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:17:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-27 20:17:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:53,539 INFO L225 Difference]: With dead ends: 2901 [2024-11-27 20:17:53,539 INFO L226 Difference]: Without dead ends: 2901 [2024-11-27 20:17:53,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:17:53,541 INFO L435 NwaCegarLoop]: 1660 mSDtfsCounter, 252 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:17:53,542 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.3s Time] [2024-11-27 20:17:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-11-27 20:17:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2708. [2024-11-27 20:17:53,587 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-27 20:17:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3571 transitions. [2024-11-27 20:17:53,594 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3571 transitions. Word has length 44 [2024-11-27 20:17:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3571 transitions. [2024-11-27 20:17:53,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3571 transitions. [2024-11-27 20:17:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:17:53,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:53,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:53,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 20:17:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:53,800 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-27 20:17:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -994558784, now seen corresponding path program 1 times [2024-11-27 20:17:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459575023] [2024-11-27 20:17:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:53,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:53,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:53,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:17:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:54,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:17:54,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:54,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:54,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459575023] [2024-11-27 20:17:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459575023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:17:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692143562] [2024-11-27 20:17:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:17:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:54,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:17:54,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:17:54,148 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-27 20:17:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:17:54,265 INFO L93 Difference]: Finished difference Result 2247 states and 2911 transitions. [2024-11-27 20:17:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:17:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-27 20:17:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:17:54,273 INFO L225 Difference]: With dead ends: 2247 [2024-11-27 20:17:54,273 INFO L226 Difference]: Without dead ends: 2247 [2024-11-27 20:17:54,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:17:54,274 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-27 20:17:54,274 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-27 20:17:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2024-11-27 20:17:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2244. [2024-11-27 20:17:54,330 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-27 20:17:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2908 transitions. [2024-11-27 20:17:54,335 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2908 transitions. Word has length 47 [2024-11-27 20:17:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:17:54,335 INFO L471 AbstractCegarLoop]: Abstraction has 2244 states and 2908 transitions. [2024-11-27 20:17:54,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:17:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2908 transitions. [2024-11-27 20:17:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 20:17:54,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:17:54,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:17:54,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:17:54,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:54,538 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-27 20:17:54,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:17:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1215894668, now seen corresponding path program 1 times [2024-11-27 20:17:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:17:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323736165] [2024-11-27 20:17:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:17:54,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:17:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:17:54,544 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:17:54,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:17:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:17:54,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 20:17:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:17:54,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:17:54,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:17:55,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:17:55,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-27 20:17:55,726 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:17:55,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:17:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:17:55,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:17:55,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:17:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323736165] [2024-11-27 20:17:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323736165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:17:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:17:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:17:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624900767] [2024-11-27 20:17:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:17:55,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:17:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:17:55,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:17:55,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:17:55,751 INFO L87 Difference]: Start difference. First operand 2244 states and 2908 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:18:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:00,567 INFO L93 Difference]: Finished difference Result 2160 states and 2788 transitions. [2024-11-27 20:18:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:18:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-27 20:18:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:00,577 INFO L225 Difference]: With dead ends: 2160 [2024-11-27 20:18:00,577 INFO L226 Difference]: Without dead ends: 2160 [2024-11-27 20:18:00,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:18:00,578 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1149 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:00,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 837 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-27 20:18:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-27 20:18:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1810. [2024-11-27 20:18:00,611 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-27 20:18:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2132 transitions. [2024-11-27 20:18:00,615 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2132 transitions. Word has length 55 [2024-11-27 20:18:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:00,616 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2132 transitions. [2024-11-27 20:18:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:18:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2132 transitions. [2024-11-27 20:18:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-27 20:18:00,617 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:00,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:00,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:18:00,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:00,818 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-27 20:18:00,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -474771177, now seen corresponding path program 1 times [2024-11-27 20:18:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:00,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755400846] [2024-11-27 20:18:00,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:00,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:00,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:00,822 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:00,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:18:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:01,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 20:18:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:01,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:18:01,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:01,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:18:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:01,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:01,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755400846] [2024-11-27 20:18:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755400846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:18:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529361480] [2024-11-27 20:18:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:01,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:01,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:18:01,379 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-27 20:18:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:06,698 INFO L93 Difference]: Finished difference Result 1809 states and 2130 transitions. [2024-11-27 20:18:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:18:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-27 20:18:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:06,706 INFO L225 Difference]: With dead ends: 1809 [2024-11-27 20:18:06,707 INFO L226 Difference]: Without dead ends: 1809 [2024-11-27 20:18:06,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:18:06,708 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 2 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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, 5.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:06,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3770 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-27 20:18:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-27 20:18:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-27 20:18:06,751 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-27 20:18:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2130 transitions. [2024-11-27 20:18:06,756 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2130 transitions. Word has length 60 [2024-11-27 20:18:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2130 transitions. [2024-11-27 20:18:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:18:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2130 transitions. [2024-11-27 20:18:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-27 20:18:06,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:06,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:06,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:18:06,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:06,959 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-27 20:18:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -474771176, now seen corresponding path program 1 times [2024-11-27 20:18:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140535209] [2024-11-27 20:18:06,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:06,965 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:06,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:18:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:07,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-27 20:18:07,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:07,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:18:07,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:18:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:07,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-27 20:18:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:07,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:07,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:07,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140535209] [2024-11-27 20:18:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140535209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:07,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:07,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:18:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397284678] [2024-11-27 20:18:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:07,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:18:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:07,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:18:07,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:18:07,533 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-27 20:18:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:14,530 INFO L93 Difference]: Finished difference Result 1808 states and 2128 transitions. [2024-11-27 20:18:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:18:14,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-27 20:18:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:14,535 INFO L225 Difference]: With dead ends: 1808 [2024-11-27 20:18:14,535 INFO L226 Difference]: Without dead ends: 1808 [2024-11-27 20:18:14,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:18:14,536 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 1 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:14,536 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.9s Time] [2024-11-27 20:18:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-27 20:18:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2024-11-27 20:18:14,560 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-27 20:18:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2128 transitions. [2024-11-27 20:18:14,565 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2128 transitions. Word has length 60 [2024-11-27 20:18:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:14,565 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2128 transitions. [2024-11-27 20:18:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:18:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2128 transitions. [2024-11-27 20:18:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:18:14,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:14,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:14,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:18:14,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:14,767 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-27 20:18:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1068454494, now seen corresponding path program 1 times [2024-11-27 20:18:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340203433] [2024-11-27 20:18:14,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:14,771 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:14,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 20:18:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:15,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:18:15,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:15,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-27 20:18:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:15,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:15,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340203433] [2024-11-27 20:18:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340203433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:18:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457088970] [2024-11-27 20:18:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:15,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:18:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:15,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:18:15,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:18:15,348 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-27 20:18:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:21,844 INFO L93 Difference]: Finished difference Result 1826 states and 2159 transitions. [2024-11-27 20:18:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:18:21,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-27 20:18:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:21,850 INFO L225 Difference]: With dead ends: 1826 [2024-11-27 20:18:21,850 INFO L226 Difference]: Without dead ends: 1826 [2024-11-27 20:18:21,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:18:21,851 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 13 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:21,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5286 Invalid, 2009 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-11-27 20:18:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-27 20:18:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1817. [2024-11-27 20:18:21,882 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-27 20:18:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2149 transitions. [2024-11-27 20:18:21,887 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2149 transitions. Word has length 68 [2024-11-27 20:18:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:21,887 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2149 transitions. [2024-11-27 20:18:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:18:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2149 transitions. [2024-11-27 20:18:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-27 20:18:21,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:21,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:21,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 20:18:22,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:22,089 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-27 20:18:22,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:22,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1068454495, now seen corresponding path program 1 times [2024-11-27 20:18:22,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:22,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1858392541] [2024-11-27 20:18:22,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:22,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:22,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:22,092 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:22,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 20:18:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:22,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:18:22,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:22,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:18:22,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858392541] [2024-11-27 20:18:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858392541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:18:22,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:18:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:18:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330442116] [2024-11-27 20:18:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:18:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:18:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:18:22,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:18:22,486 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-27 20:18:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:22,576 INFO L93 Difference]: Finished difference Result 1811 states and 2133 transitions. [2024-11-27 20:18:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:18:22,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-11-27 20:18:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:22,583 INFO L225 Difference]: With dead ends: 1811 [2024-11-27 20:18:22,583 INFO L226 Difference]: Without dead ends: 1811 [2024-11-27 20:18:22,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:18:22,584 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-27 20:18:22,584 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-27 20:18:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2024-11-27 20:18:22,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2024-11-27 20:18:22,614 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-27 20:18:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2133 transitions. [2024-11-27 20:18:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2133 transitions. Word has length 68 [2024-11-27 20:18:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:22,619 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2133 transitions. [2024-11-27 20:18:22,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:18:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2133 transitions. [2024-11-27 20:18:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-27 20:18:22,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:22,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:22,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 20:18:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:22,821 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-27 20:18:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1069331825, now seen corresponding path program 1 times [2024-11-27 20:18:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747728179] [2024-11-27 20:18:22,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:18:22,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:22,825 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:22,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 20:18:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:18:23,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:18:23,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:23,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:23,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747728179] [2024-11-27 20:18:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747728179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:18:23,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:18:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-27 20:18:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089617607] [2024-11-27 20:18:23,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:18:23,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:18:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:23,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:18:23,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:18:23,388 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-27 20:18:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:18:23,658 INFO L93 Difference]: Finished difference Result 1823 states and 2151 transitions. [2024-11-27 20:18:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:18:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-27 20:18:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:18:23,665 INFO L225 Difference]: With dead ends: 1823 [2024-11-27 20:18:23,665 INFO L226 Difference]: Without dead ends: 1823 [2024-11-27 20:18:23,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:18:23,668 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 5 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:18:23,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5794 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:18:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2024-11-27 20:18:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1821. [2024-11-27 20:18:23,707 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-27 20:18:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2148 transitions. [2024-11-27 20:18:23,713 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2148 transitions. Word has length 69 [2024-11-27 20:18:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:18:23,713 INFO L471 AbstractCegarLoop]: Abstraction has 1821 states and 2148 transitions. [2024-11-27 20:18:23,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:18:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2148 transitions. [2024-11-27 20:18:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-27 20:18:23,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:18:23,714 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:18:23,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-27 20:18:23,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:23,915 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-27 20:18:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:18:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1056680290, now seen corresponding path program 2 times [2024-11-27 20:18:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:18:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106290118] [2024-11-27 20:18:23,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:18:23,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:18:23,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:18:23,919 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:18:23,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 20:18:41,553 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:18:41,553 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:18:41,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 20:18:41,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:41,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:18:41,750 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:18:41,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:18:41,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:18:42,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:18:42,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 44 treesize of output 43 [2024-11-27 20:18:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:18:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 20:18:42,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:42,303 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:18:42,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:18:42,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:18:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106290118] [2024-11-27 20:18:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106290118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:18:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1787286623] [2024-11-27 20:18:42,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:18:42,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:18:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:18:42,401 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:18:42,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-27 20:18:43,984 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:18:43,985 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:18:44,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-27 20:18:44,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:18:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:44,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:18:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:18:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1787286623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:18:44,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:18:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2024-11-27 20:18:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559255744] [2024-11-27 20:18:44,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:18:44,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-27 20:18:44,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:18:44,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 20:18:44,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=504, Unknown=7, NotChecked=0, Total=600 [2024-11-27 20:18:44,791 INFO L87 Difference]: Start difference. First operand 1821 states and 2148 transitions. Second operand has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:19:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:19:05,577 INFO L93 Difference]: Finished difference Result 1837 states and 2170 transitions. [2024-11-27 20:19:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-27 20:19:05,578 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 72 [2024-11-27 20:19:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:19:05,582 INFO L225 Difference]: With dead ends: 1837 [2024-11-27 20:19:05,582 INFO L226 Difference]: Without dead ends: 1831 [2024-11-27 20:19:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=389, Invalid=2052, Unknown=9, NotChecked=0, Total=2450 [2024-11-27 20:19:05,583 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1168 mSDsluCounter, 10816 mSDsCounter, 0 mSdLazyCounter, 9223 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 11688 SdHoareTripleChecker+Invalid, 9276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:19:05,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 11688 Invalid, 9276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 9223 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2024-11-27 20:19:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-27 20:19:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2024-11-27 20:19:05,616 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-27 20:19:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2157 transitions. [2024-11-27 20:19:05,620 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2157 transitions. Word has length 72 [2024-11-27 20:19:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:19:05,621 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2157 transitions. [2024-11-27 20:19:05,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.454545454545454) internal successors, (142), 22 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:19:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2157 transitions. [2024-11-27 20:19:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-27 20:19:05,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:19:05,622 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:05,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 20:19:05,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-27 20:19:06,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:19:06,023 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-27 20:19:06,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash 308551935, now seen corresponding path program 1 times [2024-11-27 20:19:06,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:06,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720872441] [2024-11-27 20:19:06,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:06,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:06,026 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:06,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-27 20:19:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:06,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:19:06,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:06,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:07,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720872441] [2024-11-27 20:19:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720872441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:19:07,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:19:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-27 20:19:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829054199] [2024-11-27 20:19:07,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:19:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:19:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:07,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:19:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:19:07,455 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-27 20:19:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:19:10,163 INFO L93 Difference]: Finished difference Result 1853 states and 2196 transitions. [2024-11-27 20:19:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-27 20:19:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-27 20:19:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:19:10,167 INFO L225 Difference]: With dead ends: 1853 [2024-11-27 20:19:10,167 INFO L226 Difference]: Without dead ends: 1847 [2024-11-27 20:19:10,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-27 20:19:10,168 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 24 mSDsluCounter, 18816 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 20268 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:19:10,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 20268 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:19:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-27 20:19:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2024-11-27 20:19:10,199 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-27 20:19:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2180 transitions. [2024-11-27 20:19:10,204 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2180 transitions. Word has length 78 [2024-11-27 20:19:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:19:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2180 transitions. [2024-11-27 20:19:10,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:19:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2180 transitions. [2024-11-27 20:19:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:19:10,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:19:10,206 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:10,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-27 20:19:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:10,407 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-27 20:19:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 817749439, now seen corresponding path program 2 times [2024-11-27 20:19:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:19:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378243267] [2024-11-27 20:19:10,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:19:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:19:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:10,412 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:19:10,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-27 20:19:23,983 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:19:23,984 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:19:24,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-27 20:19:24,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:24,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:19:24,252 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:19:24,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:19:24,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:19:24,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:19:24,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:19:24,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:19:24,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:25,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:19:25,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:19:25,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:19:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:19:25,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:19:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-27 20:19:25,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:26,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1534) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-27 20:19:26,136 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:19:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378243267] [2024-11-27 20:19:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378243267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:19:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1710950189] [2024-11-27 20:19:26,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:19:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:19:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:19:26,139 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:19:26,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-27 20:19:28,217 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:19:28,217 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:19:28,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-27 20:19:28,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:19:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:30,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:19:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:19:34,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1710950189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:19:34,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:19:34,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 26, 26] total 57 [2024-11-27 20:19:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510756627] [2024-11-27 20:19:34,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:19:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-27 20:19:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:19:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-27 20:19:34,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-27 20:19:34,260 INFO L87 Difference]: Start difference. First operand 1847 states and 2180 transitions. Second operand has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:20:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:20:50,725 INFO L93 Difference]: Finished difference Result 1949 states and 2337 transitions. [2024-11-27 20:20:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-27 20:20:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 90 [2024-11-27 20:20:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:20:50,734 INFO L225 Difference]: With dead ends: 1949 [2024-11-27 20:20:50,734 INFO L226 Difference]: Without dead ends: 1933 [2024-11-27 20:20:50,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6022 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=5446, Invalid=18737, Unknown=1, NotChecked=308, Total=24492 [2024-11-27 20:20:50,741 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1186 mSDsluCounter, 24249 mSDsCounter, 0 mSdLazyCounter, 22579 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 25129 SdHoareTripleChecker+Invalid, 22655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 22579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:20:50,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 25129 Invalid, 22655 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [76 Valid, 22579 Invalid, 0 Unknown, 0 Unchecked, 57.2s Time] [2024-11-27 20:20:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2024-11-27 20:20:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1933. [2024-11-27 20:20:50,768 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-27 20:20:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2278 transitions. [2024-11-27 20:20:50,776 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2278 transitions. Word has length 90 [2024-11-27 20:20:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:20:50,776 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2278 transitions. [2024-11-27 20:20:50,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.1785714285714284) internal successors, (178), 57 states have internal predecessors, (178), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:20:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2278 transitions. [2024-11-27 20:20:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:20:50,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:20:50,778 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:50,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-27 20:20:50,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-11-27 20:20:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:51,180 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-27 20:20:51,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1958275909, now seen corresponding path program 1 times [2024-11-27 20:20:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:20:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611119884] [2024-11-27 20:20:51,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:51,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:20:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:20:51,184 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:20:51,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-27 20:20:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:51,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-27 20:20:51,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:51,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:20:51,924 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:20:51,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:20:51,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:20:52,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:52,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:20:52,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:52,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:20:52,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:20:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:20:52,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:52,534 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:20:52,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:20:52,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem34#1.base|)) is different from false [2024-11-27 20:20:52,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-27 20:20:52,988 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2210)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:20:52,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:20:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611119884] [2024-11-27 20:20:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611119884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152972371] [2024-11-27 20:20:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:52,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:20:52,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:20:52,992 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:20:52,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-27 20:20:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-27 20:20:54,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:20:54,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:20:55,144 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:20:55,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:20:55,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:20:55,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:20:56,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:20:57,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:20:57,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:20:57,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:20:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:20:57,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:20:57,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2618) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-27 20:20:57,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:20:57,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2664 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2664))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2618)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:20:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [152972371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:20:57,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:20:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-27 20:20:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379586720] [2024-11-27 20:20:57,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:20:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:20:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:20:57,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:20:57,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=285, Unknown=6, NotChecked=234, Total=600 [2024-11-27 20:20:57,701 INFO L87 Difference]: Start difference. First operand 1933 states and 2278 transitions. Second operand has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:21:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:18,901 INFO L93 Difference]: Finished difference Result 1934 states and 2279 transitions. [2024-11-27 20:21:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:21:18,901 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 115 [2024-11-27 20:21:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:18,905 INFO L225 Difference]: With dead ends: 1934 [2024-11-27 20:21:18,906 INFO L226 Difference]: Without dead ends: 1934 [2024-11-27 20:21:18,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=314, Unknown=6, NotChecked=246, Total=650 [2024-11-27 20:21:18,907 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 1150 mSDsluCounter, 8624 mSDsCounter, 0 mSdLazyCounter, 8210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 9498 SdHoareTripleChecker+Invalid, 8241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 8210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:18,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 9498 Invalid, 8241 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 8210 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2024-11-27 20:21:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2024-11-27 20:21:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1932. [2024-11-27 20:21:18,935 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-27 20:21:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2276 transitions. [2024-11-27 20:21:18,940 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2276 transitions. Word has length 115 [2024-11-27 20:21:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:18,941 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2276 transitions. [2024-11-27 20:21:18,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.933333333333334) internal successors, (89), 18 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:21:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2276 transitions. [2024-11-27 20:21:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-27 20:21:18,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:18,943 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:18,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:19,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:19,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:19,344 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-27 20:21:19,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1958275908, now seen corresponding path program 1 times [2024-11-27 20:21:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:21:19,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478462007] [2024-11-27 20:21:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:19,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:19,348 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:19,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-27 20:21:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:20,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-27 20:21:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:20,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:21:20,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:21:20,318 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:21:20,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:21:20,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:21:20,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:21:20,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:21:20,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:21:21,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:21,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:21:21,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:21:21,839 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:21:21,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:21:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:21:21,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:21:21,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:21:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:21:21,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:21:22,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:21:22,232 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-27 20:21:24,027 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3211) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3118 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3210))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3211) .cse2 v_ArrVal_3118) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:21:24,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:21:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478462007] [2024-11-27 20:21:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478462007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1861990640] [2024-11-27 20:21:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:24,037 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:21:24,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:21:24,040 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:21:24,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-27 20:22:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:22:50,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-27 20:22:50,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:50,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:22:50,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:22:50,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:22:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:22:50,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:22:50,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:22:50,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:22:50,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:51,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:51,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:51,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:22:51,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:22:51,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:22:51,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:22:51,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:22:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:22:51,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:22:51,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:22:51,956 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-27 20:22:53,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3757))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3758) .cse0 v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3757 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3758) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3757) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3666) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-27 20:22:53,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1861990640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:22:53,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:22:53,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-27 20:22:53,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930427532] [2024-11-27 20:22:53,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:22:53,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:22:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:22:53,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:22:53,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-27 20:22:53,611 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-27 20:23:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:05,863 INFO L93 Difference]: Finished difference Result 1931 states and 2274 transitions. [2024-11-27 20:23:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:23:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2024-11-27 20:23:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:05,869 INFO L225 Difference]: With dead ends: 1931 [2024-11-27 20:23:05,869 INFO L226 Difference]: Without dead ends: 1931 [2024-11-27 20:23:05,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-27 20:23:05,870 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1142 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:05,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 3140 Invalid, 4397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4387 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2024-11-27 20:23:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2024-11-27 20:23:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1931. [2024-11-27 20:23:05,896 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-27 20:23:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2274 transitions. [2024-11-27 20:23:05,900 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2274 transitions. Word has length 115 [2024-11-27 20:23:05,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:05,901 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2274 transitions. [2024-11-27 20:23:05,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:23:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2274 transitions. [2024-11-27 20:23:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 20:23:05,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:05,903 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:05,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-27 20:23:06,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-27 20:23:06,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:23:06,304 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-27 20:23:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash -456508635, now seen corresponding path program 1 times [2024-11-27 20:23:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239861357] [2024-11-27 20:23:06,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:06,309 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:06,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-27 20:23:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-27 20:23:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:07,184 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:23:07,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:23:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:23:07,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:23:07,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:07,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:23:07,764 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:07,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:23:07,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:23:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:23:07,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:23:07,949 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:23:07,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:23:08,030 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-27 20:23:08,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4179)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:23:08,059 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4179))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:23:08,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4226))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_4179)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:23:08,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239861357] [2024-11-27 20:23:08,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239861357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:23:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1760708415] [2024-11-27 20:23:08,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:08,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:23:08,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:23:08,564 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:23:08,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-27 20:23:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:11,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-27 20:23:11,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:11,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:23:11,785 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:23:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:23:11,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:23:12,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:23:13,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:13,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:23:13,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:13,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:23:13,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:13,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:23:13,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:23:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:23:13,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:23:13,685 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-27 20:23:13,695 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4650 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4650) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:23:13,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4649))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:23:13,724 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4649))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:23:14,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4649 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4650 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4696))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4649)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4650)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:23:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1760708415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:23:14,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:23:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-27 20:23:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030541498] [2024-11-27 20:23:14,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:23:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:23:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:23:14,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:23:14,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=386, Unknown=16, NotChecked=432, Total=930 [2024-11-27 20:23:14,150 INFO L87 Difference]: Start difference. First operand 1931 states and 2274 transitions. Second operand has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:23:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:23:30,522 INFO L93 Difference]: Finished difference Result 1932 states and 2275 transitions. [2024-11-27 20:23:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:23:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2024-11-27 20:23:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:23:30,528 INFO L225 Difference]: With dead ends: 1932 [2024-11-27 20:23:30,528 INFO L226 Difference]: Without dead ends: 1932 [2024-11-27 20:23:30,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=421, Unknown=16, NotChecked=450, Total=992 [2024-11-27 20:23:30,530 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1139 mSDsluCounter, 7879 mSDsCounter, 0 mSdLazyCounter, 7496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8752 SdHoareTripleChecker+Invalid, 7515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:23:30,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8752 Invalid, 7515 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7496 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2024-11-27 20:23:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-27 20:23:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1930. [2024-11-27 20:23:30,551 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-27 20:23:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2272 transitions. [2024-11-27 20:23:30,554 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2272 transitions. Word has length 118 [2024-11-27 20:23:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:23:30,555 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 2272 transitions. [2024-11-27 20:23:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.764705882352941) internal successors, (98), 20 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:23:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2272 transitions. [2024-11-27 20:23:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-27 20:23:30,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:23:30,557 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:23:30,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-27 20:23:30,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-27 20:23:30,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-27 20:23:30,958 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-27 20:23:30,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:23:30,959 INFO L85 PathProgramCache]: Analyzing trace with hash -456508634, now seen corresponding path program 1 times [2024-11-27 20:23:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:23:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730751701] [2024-11-27 20:23:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:23:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:23:30,961 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:23:30,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-27 20:23:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:23:31,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-27 20:23:31,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:23:31,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:23:31,827 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:23:31,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:23:31,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:23:31,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:23:31,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:23:32,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:23:32,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:23:32,985 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:32,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:23:32,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:23:33,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:33,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:23:33,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:23:33,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:23:33,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:23:33,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:23:33,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:23:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:23:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:23:33,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:23:33,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:23:33,655 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-27 20:23:33,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5166) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5165))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5166) .cse2 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-27 20:23:33,945 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5166) .cse1 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5166) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2024-11-27 20:23:35,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5259))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5260) .cse0 v_ArrVal_5166) .cse1 v_ArrVal_5168) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5260 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5259 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5259))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5260) .cse6 v_ArrVal_5166) (select (select (store .cse7 .cse6 v_ArrVal_5165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5168))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-27 20:23:35,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:23:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730751701] [2024-11-27 20:23:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730751701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:23:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2054192159] [2024-11-27 20:23:35,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:23:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:23:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:23:35,836 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:23:35,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-27 20:23:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:00,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-27 20:24:00,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:24:00,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:24:00,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:24:00,380 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:24:00,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:24:00,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:24:00,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:24:00,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:24:00,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:24:02,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:02,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:24:02,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:24:02,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:02,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:24:02,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:24:02,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:02,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:24:02,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:24:02,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:24:02,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:24:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:24:02,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:24:02,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:02,553 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2024-11-27 20:24:02,668 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))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5729))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5730) .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5730) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-27 20:24:02,749 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_5730) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_5729))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_5730) .cse3 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-27 20:24:05,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5824))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5729))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5823) .cse0 v_ArrVal_5730) .cse1 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5824))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5823) .cse6 v_ArrVal_5730) (select (select (store .cse7 .cse6 v_ArrVal_5729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5732))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2024-11-27 20:24:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2054192159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:24:05,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:24:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-27 20:24:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480125193] [2024-11-27 20:24:05,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:24:05,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:24:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:24:05,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:24:05,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2024-11-27 20:24:05,215 INFO L87 Difference]: Start difference. First operand 1930 states and 2272 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:24:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:24:32,576 INFO L93 Difference]: Finished difference Result 1929 states and 2270 transitions. [2024-11-27 20:24:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:24:32,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2024-11-27 20:24:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:24:32,582 INFO L225 Difference]: With dead ends: 1929 [2024-11-27 20:24:32,582 INFO L226 Difference]: Without dead ends: 1929 [2024-11-27 20:24:32,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2024-11-27 20:24:32,583 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1140 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 6221 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 6231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:24:32,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4200 Invalid, 6231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6221 Invalid, 0 Unknown, 0 Unchecked, 26.8s Time] [2024-11-27 20:24:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-27 20:24:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2024-11-27 20:24:32,607 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-27 20:24:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2270 transitions. [2024-11-27 20:24:32,613 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2270 transitions. Word has length 118 [2024-11-27 20:24:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:24:32,613 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2270 transitions. [2024-11-27 20:24:32,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 20:24:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2270 transitions. [2024-11-27 20:24:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 20:24:32,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:24:32,616 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:24:32,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-27 20:24:32,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-27 20:24:33,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:24:33,017 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-27 20:24:33,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:24:33,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1981964382, now seen corresponding path program 1 times [2024-11-27 20:24:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:24:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072286393] [2024-11-27 20:24:33,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:24:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:24:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:24:33,022 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:24:33,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-27 20:24:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:33,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-27 20:24:33,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:24:33,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:24:34,205 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:24:34,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:24:34,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:24:34,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:34,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:24:35,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:35,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:24:35,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:35,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-27 20:24:35,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:35,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:24:35,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:24:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:24:35,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:24:35,574 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-27 20:24:35,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-27 20:24:35,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-27 20:24:35,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-27 20:24:35,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6262)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-27 20:24:35,660 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:24:35,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6261))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:24:35,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6261))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-27 20:24:36,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6261 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6309))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6261)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6262)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6263) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-27 20:24:36,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:24:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072286393] [2024-11-27 20:24:36,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072286393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:24:36,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547334019] [2024-11-27 20:24:36,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:24:36,369 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:24:36,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:24:36,371 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:24:36,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-27 20:24:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:24:42,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-27 20:24:42,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:24:42,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:24:42,353 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:24:42,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:24:42,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:24:42,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-27 20:24:44,781 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:44,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-27 20:24:45,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:45,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 44 treesize of output 43 [2024-11-27 20:24:45,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:24:45,695 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:24:45,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-27 20:24:45,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-27 20:24:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:24:45,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:24:46,194 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6749) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:24:46,233 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6748))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:46,258 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:46,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6747))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:46,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6747))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:47,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6747 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6795 (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$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6795))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6747)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6748)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6749)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:24:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1547334019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:24:47,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:24:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2024-11-27 20:24:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32285696] [2024-11-27 20:24:47,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:24:47,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 20:24:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:24:47,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 20:24:47,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=467, Unknown=23, NotChecked=728, Total=1332 [2024-11-27 20:24:47,011 INFO L87 Difference]: Start difference. First operand 1929 states and 2270 transitions. Second operand has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:25:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:25:20,265 INFO L93 Difference]: Finished difference Result 1930 states and 2271 transitions. [2024-11-27 20:25:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:25:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-27 20:25:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:25:20,270 INFO L225 Difference]: With dead ends: 1930 [2024-11-27 20:25:20,270 INFO L226 Difference]: Without dead ends: 1930 [2024-11-27 20:25:20,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=506, Unknown=23, NotChecked=754, Total=1406 [2024-11-27 20:25:20,271 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 1132 mSDsluCounter, 8810 mSDsCounter, 0 mSdLazyCounter, 7934 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 9682 SdHoareTripleChecker+Invalid, 7954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:25:20,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 9682 Invalid, 7954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 7934 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2024-11-27 20:25:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-27 20:25:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2024-11-27 20:25:20,287 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-27 20:25:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2268 transitions. [2024-11-27 20:25:20,290 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2268 transitions. Word has length 121 [2024-11-27 20:25:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:25:20,291 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2268 transitions. [2024-11-27 20:25:20,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.315789473684211) internal successors, (101), 22 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:25:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2268 transitions. [2024-11-27 20:25:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-27 20:25:20,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:25:20,292 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:25:20,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-27 20:25:20,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-11-27 20:25:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:25:20,694 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-27 20:25:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:25:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1981964381, now seen corresponding path program 1 times [2024-11-27 20:25:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:25:20,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731322835] [2024-11-27 20:25:20,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:20,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:25:20,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:25:20,698 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:25:20,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-27 20:25:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:25:21,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-27 20:25:21,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:25:21,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:25:21,873 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:25:21,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:25:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:25:21,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:25:21,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:25:22,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:25:22,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:25:23,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:25:23,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:24,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:24,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:25:24,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:24,235 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:24,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:25:24,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:24,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:25:24,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-27 20:25:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:25:24,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-27 20:25:24,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:25:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:25:24,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:25:24,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-27 20:25:24,902 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-27 20:25:24,967 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7281))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7282) .cse0 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7282) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-27 20:25:25,048 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_7282) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7281))) (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$#0.offset| .cse1 v_ArrVal_7282) .cse3 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-27 20:25:25,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7279))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7281))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7280) .cse0 v_ArrVal_7282) .cse1 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7279))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7280) .cse6 v_ArrVal_7282) (select (select (store .cse7 .cse6 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-27 20:25:25,440 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7279))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7280) .cse1 v_ArrVal_7282) .cse2 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7279))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7280) .cse7 v_ArrVal_7282) (select (select (store .cse8 .cse7 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-27 20:25:31,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7375))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7279))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7281))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7376) .cse0 v_ArrVal_7280) .cse1 v_ArrVal_7282) .cse2 v_ArrVal_7284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7375))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7279))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7376) .cse8 v_ArrVal_7280) .cse9 v_ArrVal_7282) (select (select (store .cse10 .cse9 v_ArrVal_7281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7284))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-27 20:25:31,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:25:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731322835] [2024-11-27 20:25:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731322835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:25:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [564194995] [2024-11-27 20:25:31,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:25:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:25:31,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:25:31,410 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:25:31,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-27 20:26:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:12,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-27 20:26:12,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:26:12,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:26:14,258 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:26:14,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:26:14,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:26:14,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:26:14,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:26:15,728 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 18 treesize of output 10 [2024-11-27 20:26:15,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:26:19,721 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:19,722 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 50 treesize of output 45 [2024-11-27 20:26:19,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 24 treesize of output 11 [2024-11-27 20:26:20,710 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:20,711 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 50 treesize of output 45 [2024-11-27 20:26:20,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:26:21,442 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:21,442 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 50 treesize of output 45 [2024-11-27 20:26:21,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:26:22,233 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-27 20:26:22,233 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 50 treesize of output 45 [2024-11-27 20:26:22,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-27 20:26:22,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-27 20:26:22,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-27 20:26:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:26:22,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:26:23,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7862)) (.cse2 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse2))) (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse0 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7863))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7862)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse5))) (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse4 .cse5 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-27 20:26:23,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7862)) (.cse2 (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store .cse1 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (not (bvule (bvadd (_ bv12 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse2)))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7863))) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7862)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse5 .cse6 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse6)))))))))) is different from false [2024-11-27 20:26:24,084 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7861))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse2 (select (select (store .cse4 .cse5 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse2))) (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse0 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3))))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7861))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse8 (store .cse10 .cse9 v_ArrVal_7863))) (let ((.cse6 (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7860) .cse9 v_ArrVal_7862)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (or (not (bvule (bvadd (_ bv12 32) (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| .cse7))) (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse6 .cse7 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))))) is different from false [2024-11-27 20:26:24,269 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7861))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse6 .cse5 v_ArrVal_7863))) (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse0 .cse1 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| .cse1))))))))) (forall ((v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_7861))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_7860) .cse11 v_ArrVal_7862)) (.cse9 (select (select (store .cse10 .cse11 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store .cse8 .cse9 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))) (not (bvule (bvadd (_ bv12 32) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| .cse9))))))))))) is different from false [2024-11-27 20:26:27,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7956))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_7861))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7957) .cse6 v_ArrVal_7860) .cse5 v_ArrVal_7862)) (.cse2 (select (select (store .cse4 .cse5 v_ArrVal_7863) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store .cse1 .cse2 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse2)))))))))) (forall ((v_ArrVal_7957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7861 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7860 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7956))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_7861))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_7863))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7957) .cse11 v_ArrVal_7860) .cse12 v_ArrVal_7862)) (.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_7865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7864 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store .cse8 .cse9 v_ArrVal_7864) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_7865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (not (bvule (bvadd (_ bv12 32) (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| .cse9))))))))))))) is different from false [2024-11-27 20:26:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [564194995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:26:27,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-27 20:26:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2024-11-27 20:26:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446691224] [2024-11-27 20:26:27,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-27 20:26:27,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 20:26:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:26:27,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 20:26:27,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=432, Unknown=12, NotChecked=636, Total=1190 [2024-11-27 20:26:27,817 INFO L87 Difference]: Start difference. First operand 1928 states and 2268 transitions. Second operand has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:58,233 INFO L93 Difference]: Finished difference Result 2604 states and 3001 transitions. [2024-11-27 20:27:58,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:27:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2024-11-27 20:27:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:58,238 INFO L225 Difference]: With dead ends: 2604 [2024-11-27 20:27:58,238 INFO L226 Difference]: Without dead ends: 2604 [2024-11-27 20:27:58,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=180, Invalid=726, Unknown=12, NotChecked=804, Total=1722 [2024-11-27 20:27:58,239 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 2879 mSDsluCounter, 4839 mSDsCounter, 0 mSdLazyCounter, 8489 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 8522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:58,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5719 Invalid, 8522 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 8489 Invalid, 0 Unknown, 0 Unchecked, 88.5s Time] [2024-11-27 20:27:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2024-11-27 20:27:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1927. [2024-11-27 20:27:58,261 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-27 20:27:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2266 transitions. [2024-11-27 20:27:58,264 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2266 transitions. Word has length 121 [2024-11-27 20:27:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:58,264 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2266 transitions. [2024-11-27 20:27:58,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.0) internal successors, (144), 19 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-27 20:27:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2266 transitions. [2024-11-27 20:27:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-27 20:27:58,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:58,266 INFO L218 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:58,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2024-11-27 20:27:58,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-11-27 20:27:58,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:58,667 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-27 20:27:58,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash 494697893, now seen corresponding path program 1 times [2024-11-27 20:27:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:27:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689023626] [2024-11-27 20:27:58,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:58,669 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:27:58,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-27 20:27:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:59,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-27 20:27:59,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:27:59,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:28:00,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:28:00,669 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:28:00,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:28:00,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:28:00,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:28:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-27 20:28:01,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:06,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:06,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:06,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:07,794 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:07,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:07,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:08,550 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:08,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:08,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:09,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:09,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:09,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:10,160 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-27 20:28:10,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2024-11-27 20:28:10,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-27 20:28:10,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-11-27 20:28:10,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-27 20:28:10,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:28:10,965 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-27 20:28:10,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-27 20:28:11,072 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-27 20:28:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-27 20:28:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-27 20:28:11,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:28:14,051 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$#0.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_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-27 20:28:14,303 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_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8462) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8464) |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_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8463))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse2 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2024-11-27 20:28:14,668 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8463))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8462) .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse1 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (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_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8462) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))))) is different from false [2024-11-27 20:28:18,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8463))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8460) .cse0 v_ArrVal_8462) .cse1 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse3 .cse1 v_ArrVal_8465) |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_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8461))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8460) .cse6 v_ArrVal_8462) (select (select (store .cse7 .cse6 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-27 20:28:19,085 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8463))) (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$#0.offset| .cse0 v_ArrVal_8460) .cse1 v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse4 .cse2 v_ArrVal_8465) |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_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8461))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8460) .cse7 v_ArrVal_8462) (select (select (store .cse8 .cse7 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8464))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|)))))))) is different from false [2024-11-27 20:28:24,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (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_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8459))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8461))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8463))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8458) .cse0 v_ArrVal_8460) .cse1 v_ArrVal_8462) .cse2 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse4 .cse2 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (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_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8459))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8461))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8458) .cse8 v_ArrVal_8460) .cse9 v_ArrVal_8462) (select (select (store .cse10 .cse9 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8464))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))))))) is different from false [2024-11-27 20:28:25,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (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_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8459))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8461))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8458) .cse2 v_ArrVal_8460) .cse3 v_ArrVal_8462) (select (select (store .cse4 .cse3 v_ArrVal_8463) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_8464))))) |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_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (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_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|))) (forall ((v_ArrVal_8466 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8459))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_8461))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8463))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8458) .cse7 v_ArrVal_8460) .cse8 v_ArrVal_8462) .cse9 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse10 .cse9 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))) is different from false [2024-11-27 20:28:34,874 WARN L286 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 362 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-27 20:28:37,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:28:37,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819 [2024-11-27 20:28:46,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8463 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8462 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8466 (_ BitVec 32)) (v_ArrVal_8558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8465 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_6| (_ BitVec 32)) (v_ArrVal_8464 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_#t~mem32#1.base| |v_ULTIMATE.start_main_#t~malloc39#1.base_6|) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8557))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_8459))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8461))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_8463))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8558) .cse0 v_ArrVal_8458) .cse1 v_ArrVal_8460) .cse2 v_ArrVal_8462) .cse3 v_ArrVal_8464) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_6| v_ArrVal_8466) (select (select (store .cse5 .cse3 v_ArrVal_8465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (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_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_40))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_prenex_39))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_prenex_36))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_38) .cse10 v_prenex_41) .cse11 v_prenex_37) .cse12 v_prenex_35) (select (select (store .cse13 .cse12 v_prenex_34) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_43))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false [2024-11-27 20:28:46,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:28:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689023626] [2024-11-27 20:28:46,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689023626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:28:46,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1594202120] [2024-11-27 20:28:46,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:28:46,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-27 20:28:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-27 20:28:46,202 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-27 20:28:46,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f62084d-fd16-4d02-b367-0fd1bb01cae4/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-27 20:30:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:30:34,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-27 20:30:34,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:30:34,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-27 20:30:39,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-27 20:30:40,254 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-27 20:30:40,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-27 20:30:42,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-27 20:30:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-27 20:30:48,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2024-11-27 20:30:49,063 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