./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:32:01,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:32:01,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:32:01,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:32:01,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:32:01,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:32:01,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:32:01,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:32:01,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:32:01,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:32:01,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:32:01,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:32:01,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:32:01,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:32:01,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:32:01,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:32:01,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:32:01,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:32:01,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:32:01,140 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2025-03-04 09:32:01,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:32:01,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:32:01,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:32:01,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:32:01,408 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:32:01,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-03-04 09:32:03,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af61845ea/6fff0cb06ab141dcb698d17d395a0279/FLAG4c4ebf3c2 [2025-03-04 09:32:03,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:32:03,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-03-04 09:32:03,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af61845ea/6fff0cb06ab141dcb698d17d395a0279/FLAG4c4ebf3c2 [2025-03-04 09:32:03,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af61845ea/6fff0cb06ab141dcb698d17d395a0279 [2025-03-04 09:32:03,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:32:03,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:32:03,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:32:03,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:32:03,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:32:03,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:32:03" (1/1) ... [2025-03-04 09:32:03,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:03, skipping insertion in model container [2025-03-04 09:32:03,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:32:03" (1/1) ... [2025-03-04 09:32:03,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:32:03,821 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,849 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,852 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,855 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,861 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,885 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,886 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,889 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,889 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,892 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,893 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,894 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,894 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,897 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,898 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,899 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,900 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,901 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,901 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,903 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:03,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:32:03,925 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) [2025-03-04 09:32:03,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@32fef60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:03, skipping insertion in model container [2025-03-04 09:32:03,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:32:03,928 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 09:32:03,929 INFO L158 Benchmark]: Toolchain (without parser) took 385.95ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 85.0MB in the end (delta: 20.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:32:03,929 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:32:03,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.29ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 85.0MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:32:03,930 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.29ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 85.0MB in the end (delta: 19.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:32:05,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:32:05,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 09:32:05,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:32:05,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:32:05,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:32:05,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:32:05,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:32:05,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:32:05,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:32:05,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:32:05,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:32:05,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:32:05,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:32:05,782 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:32:05,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:32:05,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:32:05,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:32:05,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:32:05,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:32:05,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:32:05,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:32:05,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:32:05,785 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0dff9798a0295b679f16f480562390718a9087ab219890b5f7fb9fb3739a540b [2025-03-04 09:32:06,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:32:06,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:32:06,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:32:06,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:32:06,036 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:32:06,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-03-04 09:32:07,253 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5c71f31/4b5e2122a14b4f48885ee10a02c554a3/FLAG6530317fd [2025-03-04 09:32:07,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:32:07,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-2.i [2025-03-04 09:32:07,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5c71f31/4b5e2122a14b4f48885ee10a02c554a3/FLAG6530317fd [2025-03-04 09:32:07,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5c71f31/4b5e2122a14b4f48885ee10a02c554a3 [2025-03-04 09:32:07,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:32:07,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:32:07,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:32:07,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:32:07,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:32:07,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:32:07" (1/1) ... [2025-03-04 09:32:07,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8777cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:07, skipping insertion in model container [2025-03-04 09:32:07,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:32:07" (1/1) ... [2025-03-04 09:32:07,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:32:08,060 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,095 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,100 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,137 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,137 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,139 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,140 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,140 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,141 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,146 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,147 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,148 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,149 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,149 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,150 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,154 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:32:08,177 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 09:32:08,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:32:08,212 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,220 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,222 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,223 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,228 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,249 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,253 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,254 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,255 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,256 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,259 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,260 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,263 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,264 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,265 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,267 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,268 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,269 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,271 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:32:08,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:32:08,283 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:32:08,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:32:08,414 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:32:08,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08 WrapperNode [2025-03-04 09:32:08,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:32:08,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:32:08,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:32:08,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:32:08,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,475 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1152 [2025-03-04 09:32:08,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:32:08,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:32:08,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:32:08,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:32:08,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,587 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-04 09:32:08,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:32:08,637 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:32:08,637 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:32:08,637 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:32:08,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (1/1) ... [2025-03-04 09:32:08,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:32:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:08,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:32:08,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 09:32:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 09:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 09:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 09:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 09:32:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 09:32:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 09:32:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 09:32:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 09:32:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 09:32:08,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:32:08,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:32:08,851 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:32:08,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:32:11,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 09:32:11,914 INFO L? ?]: Removed 1292 outVars from TransFormulas that were not future-live. [2025-03-04 09:32:11,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:32:11,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:32:11,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:32:11,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:32:11 BoogieIcfgContainer [2025-03-04 09:32:11,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:32:11,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:32:11,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:32:11,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:32:11,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:32:07" (1/3) ... [2025-03-04 09:32:11,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462cdb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:32:11, skipping insertion in model container [2025-03-04 09:32:11,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:32:08" (2/3) ... [2025-03-04 09:32:11,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462cdb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:32:11, skipping insertion in model container [2025-03-04 09:32:11,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:32:11" (3/3) ... [2025-03-04 09:32:11,952 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-2.i [2025-03-04 09:32:11,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:32:11,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test7-2.i that has 5 procedures, 1255 locations, 1 initial locations, 41 loop locations, and 628 error locations. [2025-03-04 09:32:12,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:32:12,022 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;@56da9bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:32:12,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-03-04 09:32:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 1245 states, 612 states have (on average 2.2450980392156863) internal successors, (1374), 1238 states have internal predecessors, (1374), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:32:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:32:12,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:12,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:32:12,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1411020, now seen corresponding path program 1 times [2025-03-04 09:32:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827132701] [2025-03-04 09:32:12,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:12,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:12,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:32:12,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:32:12,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:32:12,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:12,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:12,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:12,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:12,232 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 [2025-03-04 09:32:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:12,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:12,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827132701] [2025-03-04 09:32:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827132701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:12,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:12,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805922941] [2025-03-04 09:32:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:12,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:12,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:12,283 INFO L87 Difference]: Start difference. First operand has 1245 states, 612 states have (on average 2.2450980392156863) internal successors, (1374), 1238 states have internal predecessors, (1374), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:13,718 INFO L93 Difference]: Finished difference Result 1414 states and 1490 transitions. [2025-03-04 09:32:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:13,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:32:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:13,728 INFO L225 Difference]: With dead ends: 1414 [2025-03-04 09:32:13,728 INFO L226 Difference]: Without dead ends: 1412 [2025-03-04 09:32:13,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:13,731 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1143 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:13,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 898 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:32:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-03-04 09:32:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1226. [2025-03-04 09:32:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 612 states have (on average 2.099673202614379) internal successors, (1285), 1220 states have internal predecessors, (1285), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1293 transitions. [2025-03-04 09:32:13,797 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1293 transitions. Word has length 3 [2025-03-04 09:32:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:13,797 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1293 transitions. [2025-03-04 09:32:13,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1293 transitions. [2025-03-04 09:32:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:32:13,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:13,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:32:13,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:32:13,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:13,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:13,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1411021, now seen corresponding path program 1 times [2025-03-04 09:32:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:14,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700190640] [2025-03-04 09:32:14,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:14,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:14,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:14,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:14,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:32:14,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:32:14,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:32:14,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:14,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:14,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:14,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:14,128 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 [2025-03-04 09:32:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:14,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:14,137 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700190640] [2025-03-04 09:32:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700190640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574799091] [2025-03-04 09:32:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:14,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:14,139 INFO L87 Difference]: Start difference. First operand 1226 states and 1293 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:16,198 INFO L93 Difference]: Finished difference Result 1819 states and 1929 transitions. [2025-03-04 09:32:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:16,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:32:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:16,203 INFO L225 Difference]: With dead ends: 1819 [2025-03-04 09:32:16,203 INFO L226 Difference]: Without dead ends: 1819 [2025-03-04 09:32:16,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:16,203 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 633 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:16,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1676 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:32:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-03-04 09:32:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1433. [2025-03-04 09:32:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 820 states have (on average 2.080487804878049) internal successors, (1706), 1427 states have internal predecessors, (1706), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1714 transitions. [2025-03-04 09:32:16,238 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1714 transitions. Word has length 3 [2025-03-04 09:32:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:16,238 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1714 transitions. [2025-03-04 09:32:16,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1714 transitions. [2025-03-04 09:32:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 09:32:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:16,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:16,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:32:16,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:16,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:16,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:16,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1773160360, now seen corresponding path program 1 times [2025-03-04 09:32:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450118136] [2025-03-04 09:32:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:16,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:16,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:32:16,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 09:32:16,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 09:32:16,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:16,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:16,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:32:16,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:16,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 5 [2025-03-04 09:32:16,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:32:16,614 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 [2025-03-04 09:32:16,628 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 09:32:16,629 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 [2025-03-04 09:32:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:16,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:16,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450118136] [2025-03-04 09:32:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450118136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079223697] [2025-03-04 09:32:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:16,644 INFO L87 Difference]: Start difference. First operand 1433 states and 1714 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 09:32:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:18,603 INFO L93 Difference]: Finished difference Result 1613 states and 1905 transitions. [2025-03-04 09:32:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-04 09:32:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:18,607 INFO L225 Difference]: With dead ends: 1613 [2025-03-04 09:32:18,608 INFO L226 Difference]: Without dead ends: 1613 [2025-03-04 09:32:18,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:18,608 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2571 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:18,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 513 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:32:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-03-04 09:32:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1214. [2025-03-04 09:32:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 612 states have (on average 2.0784313725490198) internal successors, (1272), 1208 states have internal predecessors, (1272), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1280 transitions. [2025-03-04 09:32:18,625 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1280 transitions. Word has length 7 [2025-03-04 09:32:18,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:18,626 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1280 transitions. [2025-03-04 09:32:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2025-03-04 09:32:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1280 transitions. [2025-03-04 09:32:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:32:18,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:18,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:18,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:18,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:18,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr619REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:18,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -866602378, now seen corresponding path program 1 times [2025-03-04 09:32:18,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:18,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265991186] [2025-03-04 09:32:18,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:18,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:32:18,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:32:18,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:32:18,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:18,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:18,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:18,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:18,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 7 [2025-03-04 09:32:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:18,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:18,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265991186] [2025-03-04 09:32:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265991186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:18,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610274315] [2025-03-04 09:32:18,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:18,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:18,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:18,943 INFO L87 Difference]: Start difference. First operand 1214 states and 1280 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:20,252 INFO L93 Difference]: Finished difference Result 1547 states and 1643 transitions. [2025-03-04 09:32:20,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:32:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:20,256 INFO L225 Difference]: With dead ends: 1547 [2025-03-04 09:32:20,256 INFO L226 Difference]: Without dead ends: 1547 [2025-03-04 09:32:20,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:20,257 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 920 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:20,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1486 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 09:32:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-04 09:32:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1167. [2025-03-04 09:32:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 612 states have (on average 2.0016339869281046) internal successors, (1225), 1161 states have internal predecessors, (1225), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1233 transitions. [2025-03-04 09:32:20,276 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1233 transitions. Word has length 8 [2025-03-04 09:32:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:20,277 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1233 transitions. [2025-03-04 09:32:20,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1233 transitions. [2025-03-04 09:32:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 09:32:20,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:20,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:20,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:32:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:20,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -866602377, now seen corresponding path program 1 times [2025-03-04 09:32:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418334583] [2025-03-04 09:32:20,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:20,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:20,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:20,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:20,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:32:20,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:32:20,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:32:20,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:20,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:20,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:20,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:20,589 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 [2025-03-04 09:32:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:20,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:20,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418334583] [2025-03-04 09:32:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418334583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:20,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:20,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:32:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481086553] [2025-03-04 09:32:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:20,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:20,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:20,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:20,608 INFO L87 Difference]: Start difference. First operand 1167 states and 1233 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:22,142 INFO L93 Difference]: Finished difference Result 1637 states and 1736 transitions. [2025-03-04 09:32:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:22,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 09:32:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:22,146 INFO L225 Difference]: With dead ends: 1637 [2025-03-04 09:32:22,146 INFO L226 Difference]: Without dead ends: 1637 [2025-03-04 09:32:22,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:22,148 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 688 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:22,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1852 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 09:32:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2025-03-04 09:32:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1194. [2025-03-04 09:32:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 649 states have (on average 1.9861325115562403) internal successors, (1289), 1188 states have internal predecessors, (1289), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1297 transitions. [2025-03-04 09:32:22,166 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1297 transitions. Word has length 8 [2025-03-04 09:32:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1297 transitions. [2025-03-04 09:32:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1297 transitions. [2025-03-04 09:32:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 09:32:22,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:22,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:22,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:32:22,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:22,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:22,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -796701006, now seen corresponding path program 1 times [2025-03-04 09:32:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336485369] [2025-03-04 09:32:22,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:22,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:22,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:32:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:32:22,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:32:22,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:22,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:22,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:22,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:22,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:22,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336485369] [2025-03-04 09:32:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336485369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621920457] [2025-03-04 09:32:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:22,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:22,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:22,506 INFO L87 Difference]: Start difference. First operand 1194 states and 1297 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) [2025-03-04 09:32:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:23,932 INFO L93 Difference]: Finished difference Result 1361 states and 1473 transitions. [2025-03-04 09:32:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:23,933 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 [2025-03-04 09:32:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:23,935 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 09:32:23,935 INFO L226 Difference]: Without dead ends: 1361 [2025-03-04 09:32:23,935 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 [2025-03-04 09:32:23,936 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 1141 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:23,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1434 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:32:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-04 09:32:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1171. [2025-03-04 09:32:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 649 states have (on average 1.950693374422188) internal successors, (1266), 1165 states have internal predecessors, (1266), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1274 transitions. [2025-03-04 09:32:23,950 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1274 transitions. Word has length 12 [2025-03-04 09:32:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:23,950 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1274 transitions. [2025-03-04 09:32:23,950 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) [2025-03-04 09:32:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1274 transitions. [2025-03-04 09:32:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 09:32:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:23,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:23,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:32:24,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:24,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:24,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -796701005, now seen corresponding path program 1 times [2025-03-04 09:32:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078408561] [2025-03-04 09:32:24,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:24,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:24,158 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:24,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:32:24,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:32:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:32:24,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:24,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:32:24,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:24,272 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 [2025-03-04 09:32:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:24,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:24,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:24,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078408561] [2025-03-04 09:32:24,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078408561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:24,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:24,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851120049] [2025-03-04 09:32:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:24,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:24,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:24,335 INFO L87 Difference]: Start difference. First operand 1171 states and 1274 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) [2025-03-04 09:32:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:26,294 INFO L93 Difference]: Finished difference Result 1712 states and 1850 transitions. [2025-03-04 09:32:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:26,295 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 [2025-03-04 09:32:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:26,298 INFO L225 Difference]: With dead ends: 1712 [2025-03-04 09:32:26,298 INFO L226 Difference]: Without dead ends: 1712 [2025-03-04 09:32:26,298 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 [2025-03-04 09:32:26,299 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 612 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:26,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 2149 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:32:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-04 09:32:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1360. [2025-03-04 09:32:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 838 states have (on average 1.9367541766109786) internal successors, (1623), 1354 states have internal predecessors, (1623), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1631 transitions. [2025-03-04 09:32:26,312 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1631 transitions. Word has length 12 [2025-03-04 09:32:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:26,312 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1631 transitions. [2025-03-04 09:32:26,312 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) [2025-03-04 09:32:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1631 transitions. [2025-03-04 09:32:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 09:32:26,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:26,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:26,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 09:32:26,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:26,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -809603474, now seen corresponding path program 1 times [2025-03-04 09:32:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293348196] [2025-03-04 09:32:26,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:26,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:26,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:32:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:32:26,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:32:26,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:26,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:26,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:26,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:26,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:26,661 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:26,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293348196] [2025-03-04 09:32:26,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293348196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:26,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:26,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140609251] [2025-03-04 09:32:26,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:26,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:32:26,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:26,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:32:26,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:26,662 INFO L87 Difference]: Start difference. First operand 1360 states and 1631 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2025-03-04 09:32:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:26,893 INFO L93 Difference]: Finished difference Result 2071 states and 2547 transitions. [2025-03-04 09:32:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:32:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2025-03-04 09:32:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:26,906 INFO L225 Difference]: With dead ends: 2071 [2025-03-04 09:32:26,907 INFO L226 Difference]: Without dead ends: 2071 [2025-03-04 09:32:26,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:32:26,908 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 601 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:26,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 2448 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:32:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-03-04 09:32:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1723. [2025-03-04 09:32:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1201 states have (on average 1.9050791007493755) internal successors, (2288), 1717 states have internal predecessors, (2288), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2296 transitions. [2025-03-04 09:32:26,929 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2296 transitions. Word has length 12 [2025-03-04 09:32:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2296 transitions. [2025-03-04 09:32:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2025-03-04 09:32:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2296 transitions. [2025-03-04 09:32:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:32:26,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:26,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:26,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:32:27,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:27,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 673374616, now seen corresponding path program 1 times [2025-03-04 09:32:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806982217] [2025-03-04 09:32:27,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:27,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:27,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:32:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:32:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:32:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:32:27,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:27,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:27,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806982217] [2025-03-04 09:32:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806982217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79951567] [2025-03-04 09:32:27,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:27,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:27,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:27,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:27,281 INFO L87 Difference]: Start difference. First operand 1723 states and 2296 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:27,685 INFO L93 Difference]: Finished difference Result 2072 states and 2547 transitions. [2025-03-04 09:32:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:27,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 09:32:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:27,690 INFO L225 Difference]: With dead ends: 2072 [2025-03-04 09:32:27,690 INFO L226 Difference]: Without dead ends: 2072 [2025-03-04 09:32:27,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:27,691 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 606 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 3713 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:27,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 3713 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 09:32:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2025-03-04 09:32:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1725. [2025-03-04 09:32:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1203 states have (on average 1.9027431421446384) internal successors, (2289), 1719 states have internal predecessors, (2289), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2297 transitions. [2025-03-04 09:32:27,709 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2297 transitions. Word has length 13 [2025-03-04 09:32:27,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:27,709 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2297 transitions. [2025-03-04 09:32:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2297 transitions. [2025-03-04 09:32:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 09:32:27,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:27,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:27,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:32:27,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:27,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr272REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:27,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1072028596, now seen corresponding path program 1 times [2025-03-04 09:32:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402198746] [2025-03-04 09:32:27,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:27,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:27,913 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:27,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:32:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:32:28,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:32:28,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:28,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:28,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:28,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:28,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402198746] [2025-03-04 09:32:28,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402198746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:28,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:28,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712252092] [2025-03-04 09:32:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:28,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:28,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:28,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:28,031 INFO L87 Difference]: Start difference. First operand 1725 states and 2297 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 09:32:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:28,081 INFO L93 Difference]: Finished difference Result 1653 states and 2174 transitions. [2025-03-04 09:32:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:32:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-04 09:32:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:28,084 INFO L225 Difference]: With dead ends: 1653 [2025-03-04 09:32:28,084 INFO L226 Difference]: Without dead ends: 1653 [2025-03-04 09:32:28,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:28,085 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 45 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:28,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3313 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:32:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2025-03-04 09:32:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2025-03-04 09:32:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1150 states have (on average 1.8834782608695653) internal successors, (2166), 1647 states have internal predecessors, (2166), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2174 transitions. [2025-03-04 09:32:28,102 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2174 transitions. Word has length 13 [2025-03-04 09:32:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:28,102 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2174 transitions. [2025-03-04 09:32:28,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2025-03-04 09:32:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2174 transitions. [2025-03-04 09:32:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 09:32:28,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:28,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:28,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 09:32:28,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:28,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash -639889847, now seen corresponding path program 1 times [2025-03-04 09:32:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622905472] [2025-03-04 09:32:28,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:28,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:28,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:28,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 09:32:28,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:32:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:32:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:28,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:28,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:28,427 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:32:28,427 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:32:28,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 09:32:28,430 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 30 treesize of output 39 [2025-03-04 09:32:28,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:32:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-04 09:32:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:28,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:28,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:28,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622905472] [2025-03-04 09:32:28,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622905472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:28,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:28,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625679165] [2025-03-04 09:32:28,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:28,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:28,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:28,467 INFO L87 Difference]: Start difference. First operand 1653 states and 2174 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:28,616 INFO L93 Difference]: Finished difference Result 2373 states and 2731 transitions. [2025-03-04 09:32:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 09:32:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:28,621 INFO L225 Difference]: With dead ends: 2373 [2025-03-04 09:32:28,621 INFO L226 Difference]: Without dead ends: 2373 [2025-03-04 09:32:28,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:28,621 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 1066 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:28,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 3330 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:32:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-03-04 09:32:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 1344. [2025-03-04 09:32:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 841 states have (on average 1.896551724137931) internal successors, (1595), 1338 states have internal predecessors, (1595), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1603 transitions. [2025-03-04 09:32:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1603 transitions. Word has length 14 [2025-03-04 09:32:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:28,637 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 1603 transitions. [2025-03-04 09:32:28,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1603 transitions. [2025-03-04 09:32:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:32:28,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:28,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:28,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:28,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:28,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr611REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:28,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1325205508, now seen corresponding path program 1 times [2025-03-04 09:32:28,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:28,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076526817] [2025-03-04 09:32:28,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:28,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:28,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:28,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:28,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 09:32:28,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:32:28,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:32:28,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:28,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:28,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:28,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:28,981 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 [2025-03-04 09:32:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:29,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:29,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076526817] [2025-03-04 09:32:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076526817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:29,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:29,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355762157] [2025-03-04 09:32:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:29,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:29,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:29,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:29,018 INFO L87 Difference]: Start difference. First operand 1344 states and 1603 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:30,412 INFO L93 Difference]: Finished difference Result 1715 states and 2068 transitions. [2025-03-04 09:32:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:32:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:30,416 INFO L225 Difference]: With dead ends: 1715 [2025-03-04 09:32:30,416 INFO L226 Difference]: Without dead ends: 1715 [2025-03-04 09:32:30,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:30,417 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 885 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:30,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 1479 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:32:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-03-04 09:32:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1321. [2025-03-04 09:32:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 841 states have (on average 1.8418549346016646) internal successors, (1549), 1315 states have internal predecessors, (1549), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1557 transitions. [2025-03-04 09:32:30,427 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1557 transitions. Word has length 17 [2025-03-04 09:32:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:30,427 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1557 transitions. [2025-03-04 09:32:30,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1557 transitions. [2025-03-04 09:32:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 09:32:30,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:30,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:32:30,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 09:32:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:30,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr612REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1325205507, now seen corresponding path program 1 times [2025-03-04 09:32:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:30,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229961665] [2025-03-04 09:32:30,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:30,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:30,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:30,631 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:30,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 09:32:30,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:32:30,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:32:30,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:30,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:30,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:32:30,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:30,759 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 [2025-03-04 09:32:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:30,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:30,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229961665] [2025-03-04 09:32:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229961665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:32:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204525300] [2025-03-04 09:32:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:30,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:30,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:30,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:30,818 INFO L87 Difference]: Start difference. First operand 1321 states and 1557 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:32,779 INFO L93 Difference]: Finished difference Result 1956 states and 2310 transitions. [2025-03-04 09:32:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 09:32:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:32,784 INFO L225 Difference]: With dead ends: 1956 [2025-03-04 09:32:32,784 INFO L226 Difference]: Without dead ends: 1956 [2025-03-04 09:32:32,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:32,784 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 726 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:32,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 2555 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 09:32:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-04 09:32:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1435. [2025-03-04 09:32:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 955 states have (on average 1.7664921465968586) internal successors, (1687), 1429 states have internal predecessors, (1687), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1695 transitions. [2025-03-04 09:32:32,796 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1695 transitions. Word has length 17 [2025-03-04 09:32:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:32,797 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1695 transitions. [2025-03-04 09:32:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:32:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1695 transitions. [2025-03-04 09:32:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:32:32,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:32,798 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, 1, 1, 1, 1, 1] [2025-03-04 09:32:32,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 09:32:32,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:32,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr612REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash -553119500, now seen corresponding path program 1 times [2025-03-04 09:32:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145418915] [2025-03-04 09:32:33,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:33,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:33,002 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:33,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 09:32:33,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 09:32:33,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 09:32:33,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:33,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:32:33,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:33,182 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 [2025-03-04 09:32:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:33,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:33,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145418915] [2025-03-04 09:32:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145418915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:33,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:32:33,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 09:32:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089655489] [2025-03-04 09:32:33,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:33,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:32:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:33,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:32:33,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:32:33,610 INFO L87 Difference]: Start difference. First operand 1435 states and 1695 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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) [2025-03-04 09:32:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:39,900 INFO L93 Difference]: Finished difference Result 2312 states and 2800 transitions. [2025-03-04 09:32:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:32:39,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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 36 [2025-03-04 09:32:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:39,905 INFO L225 Difference]: With dead ends: 2312 [2025-03-04 09:32:39,905 INFO L226 Difference]: Without dead ends: 2312 [2025-03-04 09:32:39,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:32:39,905 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 2132 mSDsluCounter, 3698 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 4997 SdHoareTripleChecker+Invalid, 3761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:39,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 4997 Invalid, 3761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-04 09:32:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-03-04 09:32:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1599. [2025-03-04 09:32:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1119 states have (on average 1.7149240393208223) internal successors, (1919), 1593 states have internal predecessors, (1919), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 1927 transitions. [2025-03-04 09:32:39,919 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 1927 transitions. Word has length 36 [2025-03-04 09:32:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:39,919 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 1927 transitions. [2025-03-04 09:32:39,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 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) [2025-03-04 09:32:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1927 transitions. [2025-03-04 09:32:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 09:32:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:39,920 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] [2025-03-04 09:32:39,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 09:32:40,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:40,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 501488164, now seen corresponding path program 1 times [2025-03-04 09:32:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398328397] [2025-03-04 09:32:40,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:40,123 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:40,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 09:32:40,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 09:32:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 09:32:40,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:40,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:40,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:40,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:40,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:40,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:40,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398328397] [2025-03-04 09:32:40,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398328397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:40,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:40,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:40,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968961156] [2025-03-04 09:32:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:40,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:40,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:40,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:40,332 INFO L87 Difference]: Start difference. First operand 1599 states and 1927 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2025-03-04 09:32:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:40,388 INFO L93 Difference]: Finished difference Result 1288 states and 1491 transitions. [2025-03-04 09:32:40,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:32:40,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2025-03-04 09:32:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:40,391 INFO L225 Difference]: With dead ends: 1288 [2025-03-04 09:32:40,391 INFO L226 Difference]: Without dead ends: 1288 [2025-03-04 09:32:40,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:40,392 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 56 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:40,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3074 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:32:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-04 09:32:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2025-03-04 09:32:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 829 states have (on average 1.7864897466827503) internal successors, (1481), 1280 states have internal predecessors, (1481), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1489 transitions. [2025-03-04 09:32:40,404 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1489 transitions. Word has length 51 [2025-03-04 09:32:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:40,405 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1489 transitions. [2025-03-04 09:32:40,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2025-03-04 09:32:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1489 transitions. [2025-03-04 09:32:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 09:32:40,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:40,405 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] [2025-03-04 09:32:40,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 09:32:40,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:40,607 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1298620196, now seen corresponding path program 1 times [2025-03-04 09:32:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548971418] [2025-03-04 09:32:40,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:40,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:40,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:40,610 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:40,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 09:32:40,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 09:32:40,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 09:32:40,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:40,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:40,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 09:32:40,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:40,797 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 [2025-03-04 09:32:41,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:32:41,113 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 [2025-03-04 09:32:41,122 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 09:32:41,122 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 [2025-03-04 09:32:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:41,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:41,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:41,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548971418] [2025-03-04 09:32:41,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548971418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:41,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993169889] [2025-03-04 09:32:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:41,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:32:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:32:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:41,127 INFO L87 Difference]: Start difference. First operand 1286 states and 1489 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2025-03-04 09:32:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:42,939 INFO L93 Difference]: Finished difference Result 1634 states and 1954 transitions. [2025-03-04 09:32:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:32:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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 59 [2025-03-04 09:32:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:42,943 INFO L225 Difference]: With dead ends: 1634 [2025-03-04 09:32:42,943 INFO L226 Difference]: Without dead ends: 1634 [2025-03-04 09:32:42,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:32:42,943 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1829 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:42,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 982 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:32:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-04 09:32:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1211. [2025-03-04 09:32:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 792 states have (on average 1.7285353535353536) internal successors, (1369), 1205 states have internal predecessors, (1369), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1377 transitions. [2025-03-04 09:32:42,959 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1377 transitions. Word has length 59 [2025-03-04 09:32:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1377 transitions. [2025-03-04 09:32:42,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 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) [2025-03-04 09:32:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1377 transitions. [2025-03-04 09:32:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 09:32:42,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:42,963 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] [2025-03-04 09:32:42,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 09:32:43,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:43,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:43,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:43,164 INFO L85 PathProgramCache]: Analyzing trace with hash -379593052, now seen corresponding path program 1 times [2025-03-04 09:32:43,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814825246] [2025-03-04 09:32:43,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:43,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:43,166 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:43,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 09:32:43,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 09:32:43,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 09:32:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:32:43,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:43,350 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 [2025-03-04 09:32:43,357 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 [2025-03-04 09:32:43,377 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 [2025-03-04 09:32:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:43,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:43,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:43,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814825246] [2025-03-04 09:32:43,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814825246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:43,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:43,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682155489] [2025-03-04 09:32:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:32:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:43,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:32:43,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:43,384 INFO L87 Difference]: Start difference. First operand 1211 states and 1377 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2025-03-04 09:32:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:44,807 INFO L93 Difference]: Finished difference Result 1210 states and 1376 transitions. [2025-03-04 09:32:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:32:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2025-03-04 09:32:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:44,810 INFO L225 Difference]: With dead ends: 1210 [2025-03-04 09:32:44,810 INFO L226 Difference]: Without dead ends: 1210 [2025-03-04 09:32:44,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:32:44,811 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 2 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:44,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2621 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 09:32:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-04 09:32:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2025-03-04 09:32:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 792 states have (on average 1.7272727272727273) internal successors, (1368), 1204 states have internal predecessors, (1368), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1376 transitions. [2025-03-04 09:32:44,823 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1376 transitions. Word has length 64 [2025-03-04 09:32:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:44,823 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1376 transitions. [2025-03-04 09:32:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2025-03-04 09:32:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1376 transitions. [2025-03-04 09:32:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 09:32:44,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:44,824 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] [2025-03-04 09:32:44,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 09:32:45,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:45,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr524REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:45,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:45,025 INFO L85 PathProgramCache]: Analyzing trace with hash -379593051, now seen corresponding path program 1 times [2025-03-04 09:32:45,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:45,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11644513] [2025-03-04 09:32:45,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:45,027 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:45,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 09:32:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 09:32:45,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 09:32:45,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:45,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:45,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 09:32:45,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:45,214 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 [2025-03-04 09:32:45,226 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 [2025-03-04 09:32:45,234 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 [2025-03-04 09:32:45,260 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 [2025-03-04 09:32:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:45,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:45,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11644513] [2025-03-04 09:32:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11644513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:45,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352809365] [2025-03-04 09:32:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:32:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:32:45,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:32:45,274 INFO L87 Difference]: Start difference. First operand 1210 states and 1376 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2025-03-04 09:32:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:47,074 INFO L93 Difference]: Finished difference Result 1209 states and 1375 transitions. [2025-03-04 09:32:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:32:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2025-03-04 09:32:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:47,076 INFO L225 Difference]: With dead ends: 1209 [2025-03-04 09:32:47,076 INFO L226 Difference]: Without dead ends: 1209 [2025-03-04 09:32:47,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:32:47,076 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 1 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:47,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2662 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 09:32:47,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-04 09:32:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2025-03-04 09:32:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 791 states have (on average 1.7281921618204803) internal successors, (1367), 1203 states have internal predecessors, (1367), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 09:32:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1375 transitions. [2025-03-04 09:32:47,090 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1375 transitions. Word has length 64 [2025-03-04 09:32:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1375 transitions. [2025-03-04 09:32:47,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 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) [2025-03-04 09:32:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1375 transitions. [2025-03-04 09:32:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 09:32:47,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:47,090 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, 1, 1, 1] [2025-03-04 09:32:47,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 09:32:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:47,291 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 97252673, now seen corresponding path program 1 times [2025-03-04 09:32:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180741060] [2025-03-04 09:32:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:47,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:47,293 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:47,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 09:32:47,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 09:32:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 09:32:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:47,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:47,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 09:32:47,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:47,486 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 [2025-03-04 09:32:47,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 09:32:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:47,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:47,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:47,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180741060] [2025-03-04 09:32:47,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180741060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:47,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:47,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:32:47,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085707044] [2025-03-04 09:32:47,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:32:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:47,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:32:47,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:32:47,541 INFO L87 Difference]: Start difference. First operand 1209 states and 1375 transitions. Second operand has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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) [2025-03-04 09:32:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:49,567 INFO L93 Difference]: Finished difference Result 1221 states and 1390 transitions. [2025-03-04 09:32:49,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:32:49,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 72 [2025-03-04 09:32:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:49,571 INFO L225 Difference]: With dead ends: 1221 [2025-03-04 09:32:49,571 INFO L226 Difference]: Without dead ends: 1221 [2025-03-04 09:32:49,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 09:32:49,571 INFO L435 NwaCegarLoop]: 1011 mSDtfsCounter, 8 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4217 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:49,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4217 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 09:32:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2025-03-04 09:32:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1215. [2025-03-04 09:32:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 796 states have (on average 1.7261306532663316) internal successors, (1374), 1208 states have internal predecessors, (1374), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 09:32:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1385 transitions. [2025-03-04 09:32:49,581 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1385 transitions. Word has length 72 [2025-03-04 09:32:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1385 transitions. [2025-03-04 09:32:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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) [2025-03-04 09:32:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1385 transitions. [2025-03-04 09:32:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 09:32:49,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:49,582 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, 1, 1, 1] [2025-03-04 09:32:49,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 09:32:49,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:49,782 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:49,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 97252674, now seen corresponding path program 1 times [2025-03-04 09:32:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211322012] [2025-03-04 09:32:49,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:49,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:49,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:49,785 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:49,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 09:32:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 09:32:49,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 09:32:49,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:49,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:49,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:32:49,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:49,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:32:49,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:49,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211322012] [2025-03-04 09:32:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211322012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:32:49,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:32:49,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:32:49,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146119447] [2025-03-04 09:32:49,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:32:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:32:49,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:49,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:32:49,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:49,996 INFO L87 Difference]: Start difference. First operand 1215 states and 1385 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2025-03-04 09:32:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:50,029 INFO L93 Difference]: Finished difference Result 1212 states and 1379 transitions. [2025-03-04 09:32:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:32:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 72 [2025-03-04 09:32:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:50,033 INFO L225 Difference]: With dead ends: 1212 [2025-03-04 09:32:50,033 INFO L226 Difference]: Without dead ends: 1212 [2025-03-04 09:32:50,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:32:50,034 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 0 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:50,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3058 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:32:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-03-04 09:32:50,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2025-03-04 09:32:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 793 states have (on average 1.7276166456494326) internal successors, (1370), 1206 states have internal predecessors, (1370), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 09:32:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1379 transitions. [2025-03-04 09:32:50,052 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1379 transitions. Word has length 72 [2025-03-04 09:32:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:50,052 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1379 transitions. [2025-03-04 09:32:50,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2025-03-04 09:32:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1379 transitions. [2025-03-04 09:32:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 09:32:50,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:50,053 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, 1, 1, 1, 1] [2025-03-04 09:32:50,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 09:32:50,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:50,254 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:50,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash 762726718, now seen corresponding path program 1 times [2025-03-04 09:32:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610197068] [2025-03-04 09:32:50,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:32:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:50,256 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:50,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 09:32:50,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 09:32:50,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 09:32:50,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:32:50,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:32:50,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 09:32:50,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:32:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:50,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:32:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:32:50,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 09:32:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610197068] [2025-03-04 09:32:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610197068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:32:50,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 09:32:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 09:32:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229352647] [2025-03-04 09:32:50,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 09:32:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:32:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 09:32:50,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:32:50,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:32:50,522 INFO L87 Difference]: Start difference. First operand 1212 states and 1379 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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) [2025-03-04 09:32:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:32:50,607 INFO L93 Difference]: Finished difference Result 1224 states and 1396 transitions. [2025-03-04 09:32:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:32:50,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 73 [2025-03-04 09:32:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:32:50,609 INFO L225 Difference]: With dead ends: 1224 [2025-03-04 09:32:50,609 INFO L226 Difference]: Without dead ends: 1224 [2025-03-04 09:32:50,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 09:32:50,610 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 5 mSDsluCounter, 3054 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4075 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:32:50,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4075 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:32:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-03-04 09:32:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1222. [2025-03-04 09:32:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 802 states have (on average 1.726932668329177) internal successors, (1385), 1215 states have internal predecessors, (1385), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 09:32:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1394 transitions. [2025-03-04 09:32:50,625 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1394 transitions. Word has length 73 [2025-03-04 09:32:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:32:50,625 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1394 transitions. [2025-03-04 09:32:50,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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) [2025-03-04 09:32:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1394 transitions. [2025-03-04 09:32:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 09:32:50,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:32:50,625 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, 1, 1, 1, 1] [2025-03-04 09:32:50,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 09:32:50,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:50,826 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-03-04 09:32:50,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:32:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash -943747967, now seen corresponding path program 2 times [2025-03-04 09:32:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 09:32:50,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720498967] [2025-03-04 09:32:50,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:32:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:32:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:32:50,829 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:32:50,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 09:32:50,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes.