./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:07:52,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:07:52,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:07:52,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:07:52,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:07:52,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:07:52,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:07:52,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:07:52,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:07:52,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:07:52,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:07:52,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:07:52,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:07:52,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:07:52,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:07:52,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:07:52,337 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:07:52,338 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:07:52,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:52,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:07:52,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:07:52,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:07:52,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:07:52,340 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-memcleanup) ) 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-04 07:07:52,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:07:52,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:07:52,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:07:52,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:07:52,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:07:52,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2025-03-04 07:07:53,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a11db96/2a2e805abc3e40daa92741fa7ede5d31/FLAGbc77ef7e1 [2025-03-04 07:07:53,995 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:07:53,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2025-03-04 07:07:54,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a11db96/2a2e805abc3e40daa92741fa7ede5d31/FLAGbc77ef7e1 [2025-03-04 07:07:54,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a11db96/2a2e805abc3e40daa92741fa7ede5d31 [2025-03-04 07:07:54,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:07:54,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:07:54,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:54,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:07:54,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:07:54,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:54" (1/1) ... [2025-03-04 07:07:54,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ce4679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:54, skipping insertion in model container [2025-03-04 07:07:54,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:54" (1/1) ... [2025-03-04 07:07:54,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:54,511 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,540 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,543 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,546 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,552 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,560 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,560 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,562 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,563 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,568 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:54,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:54,580 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-04 07:07:54,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@437ac975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:54, skipping insertion in model container [2025-03-04 07:07:54,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:54,581 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:07:54,582 INFO L158 Benchmark]: Toolchain (without parser) took 316.95ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 103.6MB in the end (delta: 17.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:07:54,582 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:07:54,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.38ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 103.6MB in the end (delta: 16.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:07:54,583 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.32ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.38ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 103.6MB in the end (delta: 16.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:07:56,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:07:56,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-04 07:07:56,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:07:56,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:07:56,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:07:56,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:07:56,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:07:56,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:07:56,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:07:56,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:07:56,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:07:56,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:07:56,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:07:56,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:07:56,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:07:56,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:07:56,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:07:56,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:07:56,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:07:56,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:07:56,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:56,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:07:56,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:07:56,327 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-memcleanup) ) 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2025-03-04 07:07:56,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:07:56,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:07:56,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:07:56,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:07:56,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:07:56,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2025-03-04 07:07:57,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56e3772/95905b1fe9a24549b9736d89babf4ad4/FLAG258d5264f [2025-03-04 07:07:57,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:07:57,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2025-03-04 07:07:57,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56e3772/95905b1fe9a24549b9736d89babf4ad4/FLAG258d5264f [2025-03-04 07:07:58,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56e3772/95905b1fe9a24549b9736d89babf4ad4 [2025-03-04 07:07:58,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:07:58,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:07:58,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:58,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:07:58,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:07:58,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c22e936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58, skipping insertion in model container [2025-03-04 07:07:58,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:58,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,580 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,586 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,589 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,594 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,606 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,607 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,609 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,610 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,614 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:58,632 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:07:58,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:07:58,673 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,692 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,696 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,699 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,714 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,719 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,719 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:07:58,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:58,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:07:58,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:07:58,820 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:07:58,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58 WrapperNode [2025-03-04 07:07:58,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:07:58,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:07:58,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:07:58,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:07:58,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,888 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 714 [2025-03-04 07:07:58,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:07:58,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:07:58,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:07:58,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:07:58,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,967 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [204, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 50 writes are split as follows [50, 0]. [2025-03-04 07:07:58,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:58,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:59,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:59,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:59,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:07:59,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:07:59,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:07:59,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:07:59,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (1/1) ... [2025-03-04 07:07:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:07:59,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:07:59,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:07:59,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:07:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:07:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:07:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:07:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:07:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:07:59,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:07:59,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:08:05,512 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-04 07:08:05,513 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:08:05,531 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:08:05,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:08:05,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:08:05 BoogieIcfgContainer [2025-03-04 07:08:05,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:08:05,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:08:05,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:08:05,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:08:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:07:58" (1/3) ... [2025-03-04 07:08:05,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610f3571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:08:05, skipping insertion in model container [2025-03-04 07:08:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:07:58" (2/3) ... [2025-03-04 07:08:05,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610f3571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:08:05, skipping insertion in model container [2025-03-04 07:08:05,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:08:05" (3/3) ... [2025-03-04 07:08:05,540 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2025-03-04 07:08:05,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:08:05,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test1-2.i that has 3 procedures, 136 locations, 1 initial locations, 24 loop locations, and 2 error locations. [2025-03-04 07:08:05,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:08:05,587 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;@7c01b34c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:08:05,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:08:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 125 states have (on average 1.64) internal successors, (205), 127 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:08:05,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:05,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:05,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:05,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash -652237759, now seen corresponding path program 1 times [2025-03-04 07:08:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845895023] [2025-03-04 07:08:05,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:05,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:05,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:08:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:08:05,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:08:05,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:05,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:05,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:08:05,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:08:05,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:05,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845895023] [2025-03-04 07:08:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845895023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:05,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944992463] [2025-03-04 07:08:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:05,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:05,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:05,796 INFO L87 Difference]: Start difference. First operand has 132 states, 125 states have (on average 1.64) internal successors, (205), 127 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:05,993 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2025-03-04 07:08:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:08:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:06,001 INFO L225 Difference]: With dead ends: 136 [2025-03-04 07:08:06,001 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 07:08:06,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:06,004 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 2 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:06,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:08:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 07:08:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-04 07:08:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 126 states have (on average 1.3174603174603174) internal successors, (166), 127 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2025-03-04 07:08:06,038 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 7 [2025-03-04 07:08:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 172 transitions. [2025-03-04 07:08:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2025-03-04 07:08:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:08:06,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:06,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:06,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:08:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:06,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1256450139, now seen corresponding path program 1 times [2025-03-04 07:08:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790241984] [2025-03-04 07:08:06,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:06,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:06,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:06,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:08:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:08:06,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:08:06,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:06,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:08:06,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:08:06,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:06,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790241984] [2025-03-04 07:08:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790241984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811672786] [2025-03-04 07:08:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:06,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:06,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:06,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:06,411 INFO L87 Difference]: Start difference. First operand 132 states and 172 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:10,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:12,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:13,273 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2025-03-04 07:08:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 07:08:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:13,276 INFO L225 Difference]: With dead ends: 202 [2025-03-04 07:08:13,276 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 07:08:13,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:08:13,277 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:13,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 477 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2025-03-04 07:08:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 07:08:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 173. [2025-03-04 07:08:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 168 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 224 transitions. [2025-03-04 07:08:13,286 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 224 transitions. Word has length 8 [2025-03-04 07:08:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:13,286 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 224 transitions. [2025-03-04 07:08:13,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 224 transitions. [2025-03-04 07:08:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:08:13,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:13,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:13,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:08:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:13,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:13,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -359084717, now seen corresponding path program 1 times [2025-03-04 07:08:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019483212] [2025-03-04 07:08:13,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:13,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:08:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:08:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:08:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:13,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:08:13,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:08:13,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:13,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019483212] [2025-03-04 07:08:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019483212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:08:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331242353] [2025-03-04 07:08:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:13,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:08:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:13,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:08:13,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:13,610 INFO L87 Difference]: Start difference. First operand 173 states and 224 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:17,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:19,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:19,209 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2025-03-04 07:08:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:08:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 07:08:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:19,218 INFO L225 Difference]: With dead ends: 174 [2025-03-04 07:08:19,218 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 07:08:19,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:19,218 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:19,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2025-03-04 07:08:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 07:08:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-04 07:08:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 161 states have (on average 1.31055900621118) internal successors, (211), 162 states have internal predecessors, (211), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 217 transitions. [2025-03-04 07:08:19,227 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 217 transitions. Word has length 10 [2025-03-04 07:08:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 217 transitions. [2025-03-04 07:08:19,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:08:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 217 transitions. [2025-03-04 07:08:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 07:08:19,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:19,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:19,235 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-04 07:08:19,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:19,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:19,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 71277359, now seen corresponding path program 1 times [2025-03-04 07:08:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707433214] [2025-03-04 07:08:19,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:19,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:19,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:19,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:08:19,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 07:08:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:08:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:19,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:19,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:08:19,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:19,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:19,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707433214] [2025-03-04 07:08:19,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707433214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:19,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:19,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:08:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926804554] [2025-03-04 07:08:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:19,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:08:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:19,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:08:19,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:19,760 INFO L87 Difference]: Start difference. First operand 167 states and 217 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:19,833 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2025-03-04 07:08:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:08:19,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2025-03-04 07:08:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:19,834 INFO L225 Difference]: With dead ends: 207 [2025-03-04 07:08:19,834 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:08:19,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:08:19,835 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 9 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:19,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 279 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:08:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 07:08:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 202 states have internal predecessors, (251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2025-03-04 07:08:19,845 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 75 [2025-03-04 07:08:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:19,846 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2025-03-04 07:08:19,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2025-03-04 07:08:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 07:08:19,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:19,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:19,857 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-04 07:08:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:20,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1233116370, now seen corresponding path program 1 times [2025-03-04 07:08:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298816275] [2025-03-04 07:08:20,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:20,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:20,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:20,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:20,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:08:20,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 07:08:20,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 07:08:20,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:20,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:20,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:08:20,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:08:20,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:20,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298816275] [2025-03-04 07:08:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298816275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:20,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662102696] [2025-03-04 07:08:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:20,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:20,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:20,489 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:24,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:08:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:29,826 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2025-03-04 07:08:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2025-03-04 07:08:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:29,829 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:08:29,829 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:08:29,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:08:29,830 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 274 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:29,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 329 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-03-04 07:08:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:08:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 209. [2025-03-04 07:08:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 204 states have internal predecessors, (251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2025-03-04 07:08:29,835 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 75 [2025-03-04 07:08:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:29,838 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2025-03-04 07:08:29,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2025-03-04 07:08:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 07:08:29,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:29,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:29,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:08:30,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:30,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:30,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 429082382, now seen corresponding path program 1 times [2025-03-04 07:08:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910463944] [2025-03-04 07:08:30,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:30,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:30,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:08:30,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 07:08:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 07:08:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:30,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:30,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:30,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:08:30,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:30,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910463944] [2025-03-04 07:08:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910463944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12060693] [2025-03-04 07:08:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:30,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:30,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:30,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:30,356 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:30,445 INFO L93 Difference]: Finished difference Result 175 states and 201 transitions. [2025-03-04 07:08:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:08:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2025-03-04 07:08:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:30,446 INFO L225 Difference]: With dead ends: 175 [2025-03-04 07:08:30,446 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 07:08:30,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:08:30,447 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 32 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:30,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 388 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 07:08:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 07:08:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 170 states have internal predecessors, (195), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:08:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2025-03-04 07:08:30,451 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 76 [2025-03-04 07:08:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:30,451 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2025-03-04 07:08:30,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:08:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2025-03-04 07:08:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 07:08:30,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:30,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:30,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:08:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:30,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -956861337, now seen corresponding path program 1 times [2025-03-04 07:08:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:30,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303686459] [2025-03-04 07:08:30,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:30,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:30,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:30,657 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:30,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:08:30,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 07:08:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 07:08:30,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:30,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:30,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:30,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:08:30,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:08:30,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303686459] [2025-03-04 07:08:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303686459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:08:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:08:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:08:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681571570] [2025-03-04 07:08:30,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:08:30,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:08:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:30,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:08:30,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:30,949 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-04 07:08:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:30,982 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2025-03-04 07:08:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:08:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 76 [2025-03-04 07:08:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:30,984 INFO L225 Difference]: With dead ends: 178 [2025-03-04 07:08:30,984 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 07:08:30,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:08:30,985 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:30,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:08:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 07:08:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-04 07:08:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 173 states have internal predecessors, (198), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:08:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2025-03-04 07:08:30,989 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 76 [2025-03-04 07:08:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:30,989 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2025-03-04 07:08:30,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-04 07:08:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2025-03-04 07:08:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 07:08:30,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:30,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:31,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:08:31,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:31,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 786917155, now seen corresponding path program 1 times [2025-03-04 07:08:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933124583] [2025-03-04 07:08:31,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:31,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:31,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:08:31,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 07:08:31,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 07:08:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:31,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:08:31,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:08:31,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:08:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:08:31,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:31,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933124583] [2025-03-04 07:08:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933124583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:08:31,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:08:31,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 07:08:31,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341290036] [2025-03-04 07:08:31,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:08:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:08:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:31,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:08:31,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:08:31,590 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:08:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:31,746 INFO L93 Difference]: Finished difference Result 189 states and 222 transitions. [2025-03-04 07:08:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:08:31,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2025-03-04 07:08:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:31,748 INFO L225 Difference]: With dead ends: 189 [2025-03-04 07:08:31,748 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 07:08:31,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:08:31,749 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 4 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:31,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:08:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 07:08:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-04 07:08:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 179 states have (on average 1.1843575418994414) internal successors, (212), 181 states have internal predecessors, (212), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 07:08:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2025-03-04 07:08:31,754 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 78 [2025-03-04 07:08:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:31,754 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2025-03-04 07:08:31,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:08:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2025-03-04 07:08:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 07:08:31,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:31,755 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:31,766 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-04 07:08:31,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:31,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:31,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash -974095449, now seen corresponding path program 2 times [2025-03-04 07:08:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:31,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601725273] [2025-03-04 07:08:31,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:08:31,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:31,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:31,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:31,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:08:32,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 07:08:32,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 07:08:32,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:08:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:32,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:08:32,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 07:08:32,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:08:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 07:08:32,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:32,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601725273] [2025-03-04 07:08:32,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601725273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:08:32,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:08:32,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-04 07:08:32,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727405577] [2025-03-04 07:08:32,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:08:32,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:08:32,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:32,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:08:32,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:08:32,642 INFO L87 Difference]: Start difference. First operand 187 states and 220 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:08:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:32,971 INFO L93 Difference]: Finished difference Result 385 states and 459 transitions. [2025-03-04 07:08:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:08:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2025-03-04 07:08:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:32,975 INFO L225 Difference]: With dead ends: 385 [2025-03-04 07:08:32,975 INFO L226 Difference]: Without dead ends: 385 [2025-03-04 07:08:32,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:08:32,976 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 350 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:32,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 658 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:08:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-04 07:08:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-04 07:08:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 374 states have (on average 1.1737967914438503) internal successors, (439), 376 states have internal predecessors, (439), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 07:08:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 459 transitions. [2025-03-04 07:08:32,985 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 459 transitions. Word has length 82 [2025-03-04 07:08:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 459 transitions. [2025-03-04 07:08:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:08:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 459 transitions. [2025-03-04 07:08:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-04 07:08:32,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:32,987 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:32,998 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-04 07:08:33,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:33,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:33,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash -408043271, now seen corresponding path program 1 times [2025-03-04 07:08:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501739051] [2025-03-04 07:08:33,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:08:33,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:33,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:33,191 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:33,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:08:33,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 07:08:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 07:08:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:08:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:33,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:08:33,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 124 proven. 3 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-04 07:08:33,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:08:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 106 proven. 20 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-04 07:08:34,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501739051] [2025-03-04 07:08:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501739051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:08:34,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:08:34,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 07:08:34,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605056049] [2025-03-04 07:08:34,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:08:34,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:08:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:34,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:08:34,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:08:34,077 INFO L87 Difference]: Start difference. First operand 385 states and 459 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:08:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:34,436 INFO L93 Difference]: Finished difference Result 393 states and 469 transitions. [2025-03-04 07:08:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:08:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 241 [2025-03-04 07:08:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:34,438 INFO L225 Difference]: With dead ends: 393 [2025-03-04 07:08:34,438 INFO L226 Difference]: Without dead ends: 391 [2025-03-04 07:08:34,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:08:34,439 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 6 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:34,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 902 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:08:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-04 07:08:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2025-03-04 07:08:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 378 states have (on average 1.1772486772486772) internal successors, (445), 380 states have internal predecessors, (445), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:08:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 461 transitions. [2025-03-04 07:08:34,446 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 461 transitions. Word has length 241 [2025-03-04 07:08:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:34,446 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 461 transitions. [2025-03-04 07:08:34,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:08:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 461 transitions. [2025-03-04 07:08:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-04 07:08:34,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:34,448 INFO L218 NwaCegarLoop]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:34,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:08:34,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:34,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:34,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:34,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1983921017, now seen corresponding path program 2 times [2025-03-04 07:08:34,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:34,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45022570] [2025-03-04 07:08:34,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:08:34,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:34,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:34,651 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:34,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:08:34,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 245 statements into 2 equivalence classes. [2025-03-04 07:08:35,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 245 of 245 statements. [2025-03-04 07:08:35,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:08:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:08:35,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:08:35,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:08:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-04 07:08:35,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:08:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-04 07:08:35,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:08:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45022570] [2025-03-04 07:08:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45022570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:08:35,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:08:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-04 07:08:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190749125] [2025-03-04 07:08:35,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:08:35,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:08:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:08:35,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:08:35,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:08:35,688 INFO L87 Difference]: Start difference. First operand 389 states and 461 transitions. Second operand has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:08:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:08:36,085 INFO L93 Difference]: Finished difference Result 401 states and 480 transitions. [2025-03-04 07:08:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:08:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 245 [2025-03-04 07:08:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:08:36,087 INFO L225 Difference]: With dead ends: 401 [2025-03-04 07:08:36,087 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 07:08:36,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:08:36,088 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 7 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:08:36,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1641 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:08:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 07:08:36,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2025-03-04 07:08:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 384 states have (on average 1.1848958333333333) internal successors, (455), 386 states have internal predecessors, (455), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 07:08:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 471 transitions. [2025-03-04 07:08:36,097 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 471 transitions. Word has length 245 [2025-03-04 07:08:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:08:36,098 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 471 transitions. [2025-03-04 07:08:36,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.642857142857142) internal successors, (121), 14 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:08:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 471 transitions. [2025-03-04 07:08:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 07:08:36,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:08:36,100 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:08:36,124 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-04 07:08:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:36,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:08:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:08:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -278090567, now seen corresponding path program 3 times [2025-03-04 07:08:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:08:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227653689] [2025-03-04 07:08:36,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:08:36,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:08:36,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:08:36,304 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:08:36,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:08:36,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 251 statements into 10 equivalence classes.