./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/ldv-memsafety/memleaks_test10-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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:53:30,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:53:30,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:53:30,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:53:30,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:53:30,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:53:30,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:53:30,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:53:30,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:53:30,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:53:30,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:53:30,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:53:30,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:53:30,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:53:30,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:53:30,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:53:30,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:53:30,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:30,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:53:30,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:53:30,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:53:30,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:53:30,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:53:30,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:53:30,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:53:30,192 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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2025-03-08 22:53:30,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:53:30,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:53:30,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:53:30,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:53:30,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:53:30,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2025-03-08 22:53:31,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef69c6f26/5d3b13355ee1451fa44950b437085d62/FLAG07cedff1b [2025-03-08 22:53:31,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:53:31,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2025-03-08 22:53:31,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef69c6f26/5d3b13355ee1451fa44950b437085d62/FLAG07cedff1b [2025-03-08 22:53:31,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef69c6f26/5d3b13355ee1451fa44950b437085d62 [2025-03-08 22:53:31,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:53:31,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:53:31,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:31,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:53:31,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:53:31,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:31" (1/1) ... [2025-03-08 22:53:31,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3008e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:31, skipping insertion in model container [2025-03-08 22:53:31,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:31" (1/1) ... [2025-03-08 22:53:31,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:53:32,071 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-08 22:53:32,114 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-08 22:53:32,115 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-08 22:53:32,116 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-08 22:53:32,118 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-08 22:53:32,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:32,130 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-08 22:53:32,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@13bf6d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:32, skipping insertion in model container [2025-03-08 22:53:32,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:32,131 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 22:53:32,132 INFO L158 Benchmark]: Toolchain (without parser) took 314.70ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 95.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:53:32,132 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:53:32,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.72ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 95.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:53:32,133 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.72ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 95.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test10-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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:53:33,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:53:33,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 22:53:33,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:53:33,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:53:33,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:53:33,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:53:33,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:53:33,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:53:33,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:53:33,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:53:33,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:53:33,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:53:33,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:53:33,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:53:33,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:33,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:53:33,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:53:33,967 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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2025-03-08 22:53:34,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:53:34,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:53:34,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:53:34,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:53:34,193 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:53:34,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2025-03-08 22:53:35,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f327ef/8657c3bcb80740af8b09b0f86b2735b0/FLAG4f5e2f3e0 [2025-03-08 22:53:35,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:53:35,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2025-03-08 22:53:35,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f327ef/8657c3bcb80740af8b09b0f86b2735b0/FLAG4f5e2f3e0 [2025-03-08 22:53:35,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f327ef/8657c3bcb80740af8b09b0f86b2735b0 [2025-03-08 22:53:35,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:53:35,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:53:35,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:35,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:53:35,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:53:35,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702443ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:35, skipping insertion in model container [2025-03-08 22:53:35,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:53:35" (1/1) ... [2025-03-08 22:53:35,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:53:36,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-08 22:53:36,122 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-08 22:53:36,123 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-08 22:53:36,124 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-08 22:53:36,124 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-08 22:53:36,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:36,142 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 22:53:36,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:53:36,175 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-08 22:53:36,195 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-08 22:53:36,195 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-08 22:53:36,199 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-08 22:53:36,199 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-08 22:53:36,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:36,205 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:53:36,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:53:36,269 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:53:36,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36 WrapperNode [2025-03-08 22:53:36,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:53:36,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:36,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:53:36,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:53:36,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,302 INFO L138 Inliner]: procedures = 167, calls = 92, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 76 [2025-03-08 22:53:36,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:53:36,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:53:36,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:53:36,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:53:36,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,325 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-08 22:53:36,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:53:36,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:53:36,340 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:53:36,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:53:36,341 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (1/1) ... [2025-03-08 22:53:36,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:53:36,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:36,363 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-08 22:53:36,366 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-08 22:53:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 22:53:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:53:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:53:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:53:36,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:53:36,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:53:36,525 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-08 22:53:36,826 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-03-08 22:53:36,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:53:36,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:53:36,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:53:36,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:36 BoogieIcfgContainer [2025-03-08 22:53:36,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:53:36,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:53:36,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:53:36,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:53:36,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:53:35" (1/3) ... [2025-03-08 22:53:36,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5916d3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:36, skipping insertion in model container [2025-03-08 22:53:36,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:53:36" (2/3) ... [2025-03-08 22:53:36,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5916d3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:53:36, skipping insertion in model container [2025-03-08 22:53:36,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:53:36" (3/3) ... [2025-03-08 22:53:36,842 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test10-2.i [2025-03-08 22:53:36,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:53:36,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test10-2.i that has 2 procedures, 93 locations, 1 initial locations, 0 loop locations, and 43 error locations. [2025-03-08 22:53:36,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:53:36,892 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;@65a21e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:53:36,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-08 22:53:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:53:36,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:36,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:36,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1839821458, now seen corresponding path program 1 times [2025-03-08 22:53:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073023201] [2025-03-08 22:53:36,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:36,918 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-08 22:53:36,920 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-08 22:53:36,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:53:36,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:53:36,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:36,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:36,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:37,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:37,068 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-08 22:53:37,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:37,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:37,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073023201] [2025-03-08 22:53:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073023201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:37,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:53:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727447775] [2025-03-08 22:53:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:37,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:37,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:37,095 INFO L87 Difference]: Start difference. First operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 22:53:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:37,261 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2025-03-08 22:53:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:37,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-03-08 22:53:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:37,268 INFO L225 Difference]: With dead ends: 162 [2025-03-08 22:53:37,268 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 22:53:37,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:37,271 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:37,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 285 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 22:53:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2025-03-08 22:53:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 22:53:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2025-03-08 22:53:37,301 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 11 [2025-03-08 22:53:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2025-03-08 22:53:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-08 22:53:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2025-03-08 22:53:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:53:37,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:37,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:37,309 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-08 22:53:37,504 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-08 22:53:37,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -952317777, now seen corresponding path program 1 times [2025-03-08 22:53:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468026618] [2025-03-08 22:53:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:37,507 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-08 22:53:37,508 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-08 22:53:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:53:37,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:53:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:37,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:37,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:37,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:37,580 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-08 22:53:37,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:37,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468026618] [2025-03-08 22:53:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468026618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:53:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266256962] [2025-03-08 22:53:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:37,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:53:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:37,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:53:37,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:53:37,582 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-08 22:53:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:37,778 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-03-08 22:53:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:53:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2025-03-08 22:53:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:37,780 INFO L225 Difference]: With dead ends: 163 [2025-03-08 22:53:37,780 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 22:53:37,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-08 22:53:37,780 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 63 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:37,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 281 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 22:53:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 91. [2025-03-08 22:53:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2025-03-08 22:53:37,786 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 11 [2025-03-08 22:53:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:37,787 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2025-03-08 22:53:37,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-08 22:53:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2025-03-08 22:53:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:53:37,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:37,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:37,793 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-08 22:53:37,988 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-08 22:53:37,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 474847389, now seen corresponding path program 1 times [2025-03-08 22:53:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730118895] [2025-03-08 22:53:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:37,991 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-08 22:53:37,991 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-08 22:53:38,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:38,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:38,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:53:38,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:38,062 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-08 22:53:38,129 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-08 22:53:38,169 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 22:53:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:53:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 22:53:38,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:38,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:38,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730118895] [2025-03-08 22:53:38,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730118895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:38,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:38,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2025-03-08 22:53:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332752088] [2025-03-08 22:53:38,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:38,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:53:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:38,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:53:38,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-03-08 22:53:38,845 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:39,109 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2025-03-08 22:53:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:53:39,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2025-03-08 22:53:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:39,110 INFO L225 Difference]: With dead ends: 99 [2025-03-08 22:53:39,110 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 22:53:39,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2025-03-08 22:53:39,111 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:39,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 169 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 268 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2025-03-08 22:53:39,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 22:53:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-08 22:53:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 90 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-08 22:53:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-03-08 22:53:39,122 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 15 [2025-03-08 22:53:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:39,122 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-03-08 22:53:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-03-08 22:53:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:53:39,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:39,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:39,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:53:39,323 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-08 22:53:39,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:39,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 474847390, now seen corresponding path program 1 times [2025-03-08 22:53:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:39,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415012083] [2025-03-08 22:53:39,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:39,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:39,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:39,327 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-08 22:53:39,328 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-08 22:53:39,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:39,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:39,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:39,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:39,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:53:39,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:39,395 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-08 22:53:39,400 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-08 22:53:39,507 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-08 22:53:39,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:39,529 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-08 22:53:39,539 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:53:39,540 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-08 22:53:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 22:53:39,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:39,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:39,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415012083] [2025-03-08 22:53:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415012083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1651556735] [2025-03-08 22:53:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:53:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:53:39,688 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:53:39,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-08 22:53:39,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:39,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:39,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:39,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:39,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:53:39,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:39,782 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-08 22:53:39,787 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-08 22:53:39,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:39,875 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-08 22:53:39,885 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:53:39,886 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-08 22:53:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 22:53:39,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1651556735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:39,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 22:53:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395370193] [2025-03-08 22:53:39,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:39,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:53:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:39,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:53:39,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-03-08 22:53:39,994 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:40,557 INFO L93 Difference]: Finished difference Result 186 states and 207 transitions. [2025-03-08 22:53:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:53:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-08 22:53:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:40,558 INFO L225 Difference]: With dead ends: 186 [2025-03-08 22:53:40,558 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 22:53:40,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2025-03-08 22:53:40,559 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:40,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 262 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 542 Invalid, 0 Unknown, 198 Unchecked, 0.5s Time] [2025-03-08 22:53:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 22:53:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2025-03-08 22:53:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 123 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-08 22:53:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2025-03-08 22:53:40,570 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 15 [2025-03-08 22:53:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:40,570 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2025-03-08 22:53:40,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2025-03-08 22:53:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:53:40,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:40,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:40,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:40,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:40,974 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 22:53:40,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1322103970, now seen corresponding path program 1 times [2025-03-08 22:53:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835735881] [2025-03-08 22:53:40,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:40,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:40,977 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-08 22:53:40,978 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-08 22:53:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:53:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:53:41,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:41,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:41,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:53:41,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:41,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:41,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835735881] [2025-03-08 22:53:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835735881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:53:41,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638434310] [2025-03-08 22:53:41,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:41,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:53:41,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:53:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:41,056 INFO L87 Difference]: Start difference. First operand 133 states and 181 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:41,094 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2025-03-08 22:53:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:53:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-08 22:53:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:41,096 INFO L225 Difference]: With dead ends: 88 [2025-03-08 22:53:41,096 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 22:53:41,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:53:41,096 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:41,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:53:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 22:53:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 22:53:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 80 states have internal predecessors, (83), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 22:53:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-03-08 22:53:41,102 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 15 [2025-03-08 22:53:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:41,103 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-03-08 22:53:41,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 22:53:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-03-08 22:53:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:53:41,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:41,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:41,109 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-08 22:53:41,304 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-08 22:53:41,304 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -73049639, now seen corresponding path program 1 times [2025-03-08 22:53:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331365000] [2025-03-08 22:53:41,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:41,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:41,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:41,307 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-08 22:53:41,307 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-08 22:53:41,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:53:41,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:53:41,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:41,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:53:41,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:41,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:53:41,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 22:53:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:41,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:53:41,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331365000] [2025-03-08 22:53:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331365000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:53:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:53:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:53:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053162050] [2025-03-08 22:53:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:53:41,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:53:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:41,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:53:41,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:41,386 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:53:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:41,463 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-03-08 22:53:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:53:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-08 22:53:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:41,464 INFO L225 Difference]: With dead ends: 95 [2025-03-08 22:53:41,464 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 22:53:41,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:53:41,464 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:41,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 368 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 22:53:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2025-03-08 22:53:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 83 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 22:53:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-08 22:53:41,474 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 20 [2025-03-08 22:53:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:41,475 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-08 22:53:41,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:53:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-08 22:53:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:53:41,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:41,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:41,484 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-08 22:53:41,675 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-08 22:53:41,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:41,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1880504102, now seen corresponding path program 1 times [2025-03-08 22:53:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:41,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314153565] [2025-03-08 22:53:41,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:41,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:41,680 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-08 22:53:41,681 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-08 22:53:41,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 22:53:41,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:53:41,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:41,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:41,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:53:41,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:53:41,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:41,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314153565] [2025-03-08 22:53:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314153565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:41,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2025-03-08 22:53:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110577281] [2025-03-08 22:53:41,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:53:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:41,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:53:41,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:41,808 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:41,911 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2025-03-08 22:53:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:53:41,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-08 22:53:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:41,912 INFO L225 Difference]: With dead ends: 89 [2025-03-08 22:53:41,912 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 22:53:41,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:53:41,912 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:41,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 165 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:53:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 22:53:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 22:53:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 82 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 22:53:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2025-03-08 22:53:41,920 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 20 [2025-03-08 22:53:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:41,920 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2025-03-08 22:53:41,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:53:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2025-03-08 22:53:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:53:41,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:41,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:41,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:42,121 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-08 22:53:42,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1455684462, now seen corresponding path program 1 times [2025-03-08 22:53:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316067169] [2025-03-08 22:53:42,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:42,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:42,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:42,125 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-08 22:53:42,127 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-08 22:53:42,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:53:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:53:42,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:42,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:42,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_33| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~a10~0#1.base_33|) (_ bv0 1)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~a10~0#1.base_33| (_ bv0 1)) |c_#valid|))) is different from true [2025-03-08 22:53:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:42,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:42,332 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2025-03-08 22:53:42,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2025-03-08 22:53:46,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316067169] [2025-03-08 22:53:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316067169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [849139615] [2025-03-08 22:53:46,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:53:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:53:46,413 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:53:46,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-08 22:53:46,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:53:46,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:53:46,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:46,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:46,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:53:46,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:46,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:46,693 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2025-03-08 22:53:46,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2025-03-08 22:53:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [849139615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:53:46,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-08 22:53:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790916171] [2025-03-08 22:53:46,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:46,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:53:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:46,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:53:46,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=105, Unknown=2, NotChecked=20, Total=156 [2025-03-08 22:53:46,782 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:47,276 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-03-08 22:53:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:53:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2025-03-08 22:53:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:47,278 INFO L225 Difference]: With dead ends: 136 [2025-03-08 22:53:47,278 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 22:53:47,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=54, Invalid=220, Unknown=2, NotChecked=30, Total=306 [2025-03-08 22:53:47,279 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 159 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:47,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 317 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 446 Invalid, 0 Unknown, 144 Unchecked, 0.4s Time] [2025-03-08 22:53:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 22:53:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 82. [2025-03-08 22:53:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.711111111111111) internal successors, (77), 76 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 22:53:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2025-03-08 22:53:47,285 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 23 [2025-03-08 22:53:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:47,286 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2025-03-08 22:53:47,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:53:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2025-03-08 22:53:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:53:47,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:47,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:47,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:47,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 22:53:47,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:47,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:47,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1302248297, now seen corresponding path program 1 times [2025-03-08 22:53:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75532884] [2025-03-08 22:53:47,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:47,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:47,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:47,690 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-08 22:53:47,690 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-08 22:53:47,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:53:47,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:53:47,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:47,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:47,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:53:47,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:47,742 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-08 22:53:47,763 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 15 treesize of output 1 [2025-03-08 22:53:47,782 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 19 treesize of output 11 [2025-03-08 22:53:47,849 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-08 22:53:47,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 22:53:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:47,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:53:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:53:55,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:53:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75532884] [2025-03-08 22:53:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75532884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:53:55,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:53:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-08 22:53:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571583989] [2025-03-08 22:53:55,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:53:55,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:53:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:53:55,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:53:55,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2025-03-08 22:53:55,584 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:53:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:53:55,842 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-08 22:53:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:53:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-08 22:53:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:53:55,845 INFO L225 Difference]: With dead ends: 90 [2025-03-08 22:53:55,845 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 22:53:55,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2025-03-08 22:53:55,845 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:53:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 264 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:53:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 22:53:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-08 22:53:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 22:53:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-03-08 22:53:55,850 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2025-03-08 22:53:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:53:55,850 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-03-08 22:53:55,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:53:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-03-08 22:53:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:53:55,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:53:55,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:53:55,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:53:56,051 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-08 22:53:56,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:53:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:53:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1302248296, now seen corresponding path program 1 times [2025-03-08 22:53:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:53:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035667688] [2025-03-08 22:53:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:53:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:53:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:53:56,054 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-08 22:53:56,054 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-08 22:53:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:53:56,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:53:56,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:53:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:53:56,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:53:56,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:53:56,139 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-08 22:53:56,145 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-08 22:53:56,199 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 15 treesize of output 1 [2025-03-08 22:53:56,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:53:56,268 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 28 treesize of output 16 [2025-03-08 22:53:56,322 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-08 22:53:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:53:56,339 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-08 22:53:56,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:53:56,348 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-08 22:53:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-08 22:53:56,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:04,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035667688] [2025-03-08 22:54:04,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035667688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:04,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1243900555] [2025-03-08 22:54:04,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:04,526 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:04,529 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:04,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-08 22:54:04,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:54:04,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:54:04,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:04,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:04,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:54:04,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:04,634 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-08 22:54:04,637 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-08 22:54:04,657 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 15 treesize of output 1 [2025-03-08 22:54:04,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:04,707 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 28 treesize of output 16 [2025-03-08 22:54:04,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:54:04,739 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-08 22:54:04,746 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:04,747 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-08 22:54:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-08 22:54:04,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1243900555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:08,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-08 22:54:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886604890] [2025-03-08 22:54:08,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:54:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:54:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=86, Unknown=3, NotChecked=18, Total=132 [2025-03-08 22:54:08,867 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:54:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:09,266 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-08 22:54:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:54:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 22:54:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:09,267 INFO L225 Difference]: With dead ends: 90 [2025-03-08 22:54:09,267 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 22:54:09,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=39, Invalid=144, Unknown=3, NotChecked=24, Total=210 [2025-03-08 22:54:09,268 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:09,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 299 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 305 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2025-03-08 22:54:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 22:54:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-08 22:54:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 81 states have internal predecessors, (83), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 22:54:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2025-03-08 22:54:09,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 25 [2025-03-08 22:54:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:09,271 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2025-03-08 22:54:09,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:54:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2025-03-08 22:54:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:54:09,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:09,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:09,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-03-08 22:54:09,478 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-08 22:54:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:09,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1807806922, now seen corresponding path program 1 times [2025-03-08 22:54:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100633431] [2025-03-08 22:54:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:09,675 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-08 22:54:09,675 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-08 22:54:09,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:54:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:54:09,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:54:09,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:09,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:54:09,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:09,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100633431] [2025-03-08 22:54:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100633431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:09,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:09,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:54:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845341310] [2025-03-08 22:54:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:54:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:54:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:54:09,803 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:54:09,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:09,883 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-03-08 22:54:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:54:09,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 22:54:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:09,884 INFO L225 Difference]: With dead ends: 84 [2025-03-08 22:54:09,884 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 22:54:09,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:54:09,884 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:54:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 22:54:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 22:54:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 74 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:54:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-03-08 22:54:09,886 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2025-03-08 22:54:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:09,887 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-03-08 22:54:09,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:54:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-03-08 22:54:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:54:09,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:09,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:09,894 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-08 22:54:10,088 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-08 22:54:10,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:10,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1160612434, now seen corresponding path program 1 times [2025-03-08 22:54:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703494854] [2025-03-08 22:54:10,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:10,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:10,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:10,090 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-08 22:54:10,091 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-08 22:54:10,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:54:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:54:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:10,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:10,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:54:10,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:10,155 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-08 22:54:10,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:10,199 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-08 22:54:10,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:14,247 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|))) is different from true [2025-03-08 22:54:14,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:54:14,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 22:54:14,358 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 27 treesize of output 15 [2025-03-08 22:54:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 22:54:14,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:14,413 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2025-03-08 22:54:14,413 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 23 treesize of output 22 [2025-03-08 22:54:14,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703494854] [2025-03-08 22:54:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703494854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13474174] [2025-03-08 22:54:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:14,454 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:14,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-08 22:54:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:54:14,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:54:14,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:14,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:54:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:14,571 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-08 22:54:14,598 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:14,598 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-08 22:54:14,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:18,631 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4|)))) is different from true [2025-03-08 22:54:18,682 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:54:18,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 22:54:18,694 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 27 treesize of output 15 [2025-03-08 22:54:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 22:54:18,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:18,713 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2025-03-08 22:54:18,713 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 23 treesize of output 22 [2025-03-08 22:54:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [13474174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:18,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2025-03-08 22:54:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84474381] [2025-03-08 22:54:18,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:18,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:54:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:18,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:54:18,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=146, Unknown=11, NotChecked=50, Total=240 [2025-03-08 22:54:18,753 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:27,270 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-03-08 22:54:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:54:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-08 22:54:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:27,271 INFO L225 Difference]: With dead ends: 113 [2025-03-08 22:54:27,271 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 22:54:27,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=72, Invalid=339, Unknown=17, NotChecked=78, Total=506 [2025-03-08 22:54:27,272 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 95 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:27,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 431 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 496 Invalid, 0 Unknown, 228 Unchecked, 0.4s Time] [2025-03-08 22:54:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 22:54:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2025-03-08 22:54:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.625) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:54:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-03-08 22:54:27,277 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 28 [2025-03-08 22:54:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:27,277 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-03-08 22:54:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:54:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-03-08 22:54:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:54:27,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:27,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:27,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-08 22:54:27,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:54:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:27,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:27,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1160612435, now seen corresponding path program 1 times [2025-03-08 22:54:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253677491] [2025-03-08 22:54:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:27,681 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-08 22:54:27,682 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-08 22:54:27,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:54:27,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:54:27,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:54:27,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:27,758 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-08 22:54:27,808 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:27,809 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-08 22:54:27,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:27,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:27,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:54:27,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 22:54:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 22:54:28,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 22:54:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:54:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:28,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:28,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:54:28,210 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 50 treesize of output 54 [2025-03-08 22:54:28,256 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_prenex_7) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_229) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem51#1.offset|))) (or (forall ((v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_228) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (forall ((v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_229) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))))) is different from false [2025-03-08 22:54:28,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253677491] [2025-03-08 22:54:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253677491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [619536760] [2025-03-08 22:54:28,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:28,281 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:28,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:28,283 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-08 22:54:28,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:54:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:54:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:28,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:54:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:28,388 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-08 22:54:28,429 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:28,429 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-08 22:54:28,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:28,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:28,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:54:28,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 22:54:28,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 22:54:28,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 22:54:28,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:54:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:28,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:28,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:54:28,657 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 50 treesize of output 54 [2025-03-08 22:54:28,724 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_254) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_253) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_prenex_9) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_254 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_254) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem51#1.offset|)))) is different from false [2025-03-08 22:54:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [619536760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:28,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-08 22:54:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374307919] [2025-03-08 22:54:28,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:28,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:54:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:28,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:54:28,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=178, Unknown=2, NotChecked=54, Total=272 [2025-03-08 22:54:28,749 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:54:37,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:54:41,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:54:45,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:54:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:45,825 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2025-03-08 22:54:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:54:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-03-08 22:54:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:45,826 INFO L225 Difference]: With dead ends: 124 [2025-03-08 22:54:45,826 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 22:54:45,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=385, Unknown=2, NotChecked=82, Total=552 [2025-03-08 22:54:45,827 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:45,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 513 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 569 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2025-03-08 22:54:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 22:54:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2025-03-08 22:54:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:54:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-03-08 22:54:45,832 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 28 [2025-03-08 22:54:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-03-08 22:54:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-03-08 22:54:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:54:45,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:45,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:45,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-08 22:54:46,041 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-08 22:54:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:46,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1342946709, now seen corresponding path program 1 times [2025-03-08 22:54:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604715724] [2025-03-08 22:54:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:46,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:46,237 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-08 22:54:46,238 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-08 22:54:46,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:54:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:54:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:46,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:54:46,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:54:46,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:54:46,318 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604715724] [2025-03-08 22:54:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604715724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:54:46,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:54:46,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:54:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090348630] [2025-03-08 22:54:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:54:46,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:54:46,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:46,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:54:46,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:54:46,319 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:54:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:46,406 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-03-08 22:54:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:54:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-08 22:54:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:46,407 INFO L225 Difference]: With dead ends: 85 [2025-03-08 22:54:46,407 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 22:54:46,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-08 22:54:46,407 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:46,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 120 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:54:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 22:54:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-08 22:54:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:54:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-03-08 22:54:46,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 30 [2025-03-08 22:54:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-03-08 22:54:46,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:54:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-03-08 22:54:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:54:46,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:46,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:46,420 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-08 22:54:46,618 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-08 22:54:46,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1342946708, now seen corresponding path program 1 times [2025-03-08 22:54:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581235456] [2025-03-08 22:54:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:46,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:46,621 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-08 22:54:46,621 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-08 22:54:46,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:54:46,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:54:46,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:46,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:46,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:54:46,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:54:46,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:46,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-08 22:54:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 22:54:46,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:46,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581235456] [2025-03-08 22:54:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581235456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:54:46,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:46,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-08 22:54:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701957170] [2025-03-08 22:54:46,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:54:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:46,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:54:46,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:54:46,867 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:54:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:54:47,098 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-03-08 22:54:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:54:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2025-03-08 22:54:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:54:47,099 INFO L225 Difference]: With dead ends: 84 [2025-03-08 22:54:47,099 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 22:54:47,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:54:47,100 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 98 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:54:47,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 353 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:54:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 22:54:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 22:54:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:54:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-03-08 22:54:47,102 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 30 [2025-03-08 22:54:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:54:47,102 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-03-08 22:54:47,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:54:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-03-08 22:54:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:54:47,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:54:47,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:54:47,111 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-08 22:54:47,305 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-08 22:54:47,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:54:47,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:54:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1318321807, now seen corresponding path program 1 times [2025-03-08 22:54:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:54:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879605130] [2025-03-08 22:54:47,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:47,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:54:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:54:47,312 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-08 22:54:47,313 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-08 22:54:47,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:54:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:54:47,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:47,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:47,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 22:54:47,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:47,381 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-08 22:54:47,427 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:47,427 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-08 22:54:47,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:47,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:47,482 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 16 treesize of output 8 [2025-03-08 22:54:47,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:54:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:47,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:47,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_314) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) is different from false [2025-03-08 22:54:47,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:54:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879605130] [2025-03-08 22:54:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879605130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675101637] [2025-03-08 22:54:47,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:54:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:54:47,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:54:47,619 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:54:47,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-03-08 22:54:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:54:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:54:47,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:54:47,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:54:47,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 22:54:47,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:54:47,734 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-08 22:54:47,766 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:54:47,766 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-08 22:54:47,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:54:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:54:47,797 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 16 treesize of output 8 [2025-03-08 22:54:47,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:54:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:54:47,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:54:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1675101637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:54:47,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:54:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-08 22:54:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530148339] [2025-03-08 22:54:47,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:54:47,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:54:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:54:47,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:54:47,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=145, Unknown=8, NotChecked=24, Total=210 [2025-03-08 22:54:47,918 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:54:51,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:54:56,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:55:00,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:55:04,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:55:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:55:04,455 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2025-03-08 22:55:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:55:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-03-08 22:55:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:55:04,457 INFO L225 Difference]: With dead ends: 119 [2025-03-08 22:55:04,457 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 22:55:04,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=335, Unknown=11, NotChecked=38, Total=462 [2025-03-08 22:55:04,457 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 17 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:55:04,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 472 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 482 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2025-03-08 22:55:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 22:55:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2025-03-08 22:55:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:55:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-03-08 22:55:04,460 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 31 [2025-03-08 22:55:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:55:04,460 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-03-08 22:55:04,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 22:55:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-03-08 22:55:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:55:04,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:55:04,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:55:04,470 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-08 22:55:04,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2025-03-08 22:55:04,863 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,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 22:55:04,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:55:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:55:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1318325008, now seen corresponding path program 1 times [2025-03-08 22:55:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:55:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257071073] [2025-03-08 22:55:04,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:55:04,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:55:04,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:55:04,866 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:55:04,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 22:55:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:55:04,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:55:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:55:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:55:04,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:55:04,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:55:04,945 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 19 treesize of output 11 [2025-03-08 22:55:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:55:04,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:55:04,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:55:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257071073] [2025-03-08 22:55:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257071073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:55:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:55:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:55:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986541247] [2025-03-08 22:55:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:55:04,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:55:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:55:04,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:55:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:55:04,953 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:55:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:55:05,107 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-03-08 22:55:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:55:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-08 22:55:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:55:05,108 INFO L225 Difference]: With dead ends: 88 [2025-03-08 22:55:05,108 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 22:55:05,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:55:05,108 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:55:05,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 216 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:55:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 22:55:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-03-08 22:55:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:55:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-03-08 22:55:05,110 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 31 [2025-03-08 22:55:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:55:05,110 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-03-08 22:55:05,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:55:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-03-08 22:55:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 22:55:05,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:55:05,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:55:05,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 22:55:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:55:05,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:55:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:55:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1318325009, now seen corresponding path program 1 times [2025-03-08 22:55:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:55:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545423556] [2025-03-08 22:55:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:55:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:55:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:55:05,314 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:55:05,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 22:55:05,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:55:05,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:55:05,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:55:05,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:55:05,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:55:05,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:55:05,454 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 15 [2025-03-08 22:55:05,456 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 32 treesize of output 16 [2025-03-08 22:55:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:55:05,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:55:05,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:55:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545423556] [2025-03-08 22:55:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545423556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:55:05,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:55:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:55:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225847176] [2025-03-08 22:55:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:55:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:55:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:55:05,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:55:05,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:55:05,479 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:55:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:55:05,770 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-03-08 22:55:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:55:05,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-08 22:55:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:55:05,771 INFO L225 Difference]: With dead ends: 88 [2025-03-08 22:55:05,771 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 22:55:05,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:55:05,771 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:55:05,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 248 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:55:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 22:55:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2025-03-08 22:55:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 22:55:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-03-08 22:55:05,776 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 31 [2025-03-08 22:55:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:55:05,776 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-03-08 22:55:05,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:55:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-03-08 22:55:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:55:05,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:55:05,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:55:05,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 22:55:05,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:55:05,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 40 more)] === [2025-03-08 22:55:05,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:55:05,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2081696957, now seen corresponding path program 1 times [2025-03-08 22:55:05,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:55:05,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710431501] [2025-03-08 22:55:05,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:55:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:55:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:55:05,979 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:55:05,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 22:55:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:55:06,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:55:06,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:55:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:55:06,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 22:55:06,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:55:06,043 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-08 22:55:06,091 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:55:06,091 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-08 22:55:06,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:55:06,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:55:06,150 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 7 treesize of output 3 [2025-03-08 22:55:10,188 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24|))) is different from true [2025-03-08 22:55:10,296 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2025-03-08 22:55:10,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 53 [2025-03-08 22:55:10,409 INFO L349 Elim1Store]: treesize reduction 29, result has 29.3 percent of original size [2025-03-08 22:55:10,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 27 [2025-03-08 22:55:10,466 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 16 treesize of output 8 [2025-03-08 22:55:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 22:55:10,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:55:10,530 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 8 treesize of output 4 [2025-03-08 22:55:11,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:55:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710431501] [2025-03-08 22:55:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710431501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:55:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1304826416] [2025-03-08 22:55:11,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:55:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:55:11,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:55:11,924 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:55:11,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2025-03-08 22:55:11,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:55:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:55:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:55:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:55:12,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:55:12,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:55:12,036 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-08 22:55:12,098 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:55:12,098 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-08 22:55:12,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:55:12,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:55:12,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-03-08 22:55:12,415 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-08 22:55:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:55:12,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:55:12,512 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_420) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2025-03-08 22:55:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1304826416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:55:12,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:55:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2025-03-08 22:55:12,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711641389] [2025-03-08 22:55:12,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:55:12,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:55:12,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:55:12,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:55:12,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=690, Unknown=2, NotChecked=106, Total=870 [2025-03-08 22:55:12,520 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 22:55:16,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]