./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:59:02,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:59:02,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:59:02,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:59:02,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:59:02,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:59:02,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:59:02,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:59:02,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:59:02,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:59:02,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:59:02,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:59:02,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:59:02,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:59:02,206 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:59:02,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:59:02,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:59:02,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:02,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:02,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:59:02,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:59:02,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:59:02,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:59:02,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:59:02,209 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-jdk21/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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-09 21:59:02,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:59:02,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:59:02,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:59:02,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:59:02,479 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:59:02,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2025-01-09 21:59:03,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95b80ee42/67a7fbedddd74d119d3017d05f3d7dab/FLAGa687e7a5e [2025-01-09 21:59:03,998 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:59:03,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2025-01-09 21:59:04,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95b80ee42/67a7fbedddd74d119d3017d05f3d7dab/FLAGa687e7a5e [2025-01-09 21:59:04,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95b80ee42/67a7fbedddd74d119d3017d05f3d7dab [2025-01-09 21:59:04,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:59:04,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:59:04,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:04,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:59:04,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:59:04,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:04" (1/1) ... [2025-01-09 21:59:04,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7269041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:04, skipping insertion in model container [2025-01-09 21:59:04,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:04" (1/1) ... [2025-01-09 21:59:04,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:59:04,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,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-01-09 21:59:04,571 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,574 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,581 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,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-01-09 21:59:04,612 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,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-01-09 21:59:04,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,627 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,628 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,629 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,630 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,631 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,631 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,636 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,637 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,637 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,638 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,644 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:04,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:04,662 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-01-09 21:59:04,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6bbed60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:04, skipping insertion in model container [2025-01-09 21:59:04,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:04,663 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-01-09 21:59:04,664 INFO L158 Benchmark]: Toolchain (without parser) took 394.06ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 89.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:59:04,664 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:59:04,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.70ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 89.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:59:04,665 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.70ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 89.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:59:06,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:59:06,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-01-09 21:59:06,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:59:06,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:59:06,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:59:06,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:59:06,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:59:06,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:59:06,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:59:06,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:59:06,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:59:06,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:59:06,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:59:06,547 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:59:06,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:59:06,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:59:06,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:06,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:59:06,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:06,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:59:06,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:59:06,549 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-jdk21/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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-09 21:59:06,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:59:06,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:59:06,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:59:06,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:59:06,808 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:59:06,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2025-01-09 21:59:08,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d47299316/0ef9ff96207343f0897bf68832a2ac5d/FLAGe62698f67 [2025-01-09 21:59:08,325 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:59:08,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2025-01-09 21:59:08,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d47299316/0ef9ff96207343f0897bf68832a2ac5d/FLAGe62698f67 [2025-01-09 21:59:08,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d47299316/0ef9ff96207343f0897bf68832a2ac5d [2025-01-09 21:59:08,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:59:08,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:59:08,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:08,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:59:08,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:59:08,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:08" (1/1) ... [2025-01-09 21:59:08,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70292a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:08, skipping insertion in model container [2025-01-09 21:59:08,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:59:08" (1/1) ... [2025-01-09 21:59:08,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:59:08,978 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,013 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,017 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,033 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,062 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,068 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,076 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,084 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,086 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,088 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,099 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,100 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,101 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,101 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,104 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:09,127 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-09 21:59:09,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:59:09,162 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,181 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,182 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,183 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,186 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,204 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,205 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,206 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,213 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,226 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,227 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,228 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,229 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,230 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,231 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,235 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,235 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,237 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,237 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,239 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:59:09,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:09,251 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:59:09,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:59:09,397 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:59:09,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09 WrapperNode [2025-01-09 21:59:09,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:59:09,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:59:09,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:59:09,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:59:09,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,468 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1374 [2025-01-09 21:59:09,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:59:09,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:59:09,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:59:09,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:59:09,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,580 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-01-09 21:59:09,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:59:09,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:59:09,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:59:09,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:59:09,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (1/1) ... [2025-01-09 21:59:09,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:59:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:09,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:59:09,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:59:09,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:59:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:59:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 21:59:09,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:59:09,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:59:09,907 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:59:09,909 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:59:24,475 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2025-01-09 21:59:24,475 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:59:24,487 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:59:24,489 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-09 21:59:24,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:59:24 BoogieIcfgContainer [2025-01-09 21:59:24,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:59:24,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:59:24,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:59:24,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:59:24,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:59:08" (1/3) ... [2025-01-09 21:59:24,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5745b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:59:24, skipping insertion in model container [2025-01-09 21:59:24,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:59:09" (2/3) ... [2025-01-09 21:59:24,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5745b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:59:24, skipping insertion in model container [2025-01-09 21:59:24,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:59:24" (3/3) ... [2025-01-09 21:59:24,500 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-3.i [2025-01-09 21:59:24,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:59:24,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test4-3.i that has 3 procedures, 248 locations, 1 initial locations, 45 loop locations, and 2 error locations. [2025-01-09 21:59:24,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:59:24,556 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;@1c780913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:59:24,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:59:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 236 states have internal predecessors, (385), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:59:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 21:59:24,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:24,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 21:59:24,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:24,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1419133, now seen corresponding path program 1 times [2025-01-09 21:59:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:59:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703481591] [2025-01-09 21:59:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:24,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:24,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:24,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:59:24,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 21:59:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 21:59:24,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:24,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:24,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:59:24,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:24,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:24,757 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:59:24,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703481591] [2025-01-09 21:59:24,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703481591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:24,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:24,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:59:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528898994] [2025-01-09 21:59:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:59:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:59:24,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:59:24,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:59:24,783 INFO L87 Difference]: Start difference. First operand has 244 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 236 states have internal predecessors, (385), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 21:59:28,863 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-01-09 21:59:32,933 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-01-09 21:59:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:33,179 INFO L93 Difference]: Finished difference Result 303 states and 398 transitions. [2025-01-09 21:59:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:59:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-09 21:59:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:33,192 INFO L225 Difference]: With dead ends: 303 [2025-01-09 21:59:33,192 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 21:59:33,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 21:59:33,195 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 77 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:33,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 645 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 21:59:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 21:59:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2025-01-09 21:59:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 242 states have internal predecessors, (316), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:59:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 328 transitions. [2025-01-09 21:59:33,250 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 328 transitions. Word has length 4 [2025-01-09 21:59:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:33,250 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 328 transitions. [2025-01-09 21:59:33,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 21:59:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2025-01-09 21:59:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 21:59:33,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:33,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:33,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:59:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:33,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:33,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1517024063, now seen corresponding path program 1 times [2025-01-09 21:59:33,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:59:33,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846048888] [2025-01-09 21:59:33,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:33,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:33,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:33,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:33,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:59:33,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 21:59:33,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 21:59:33,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:33,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:59:33,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:33,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:33,654 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:59:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846048888] [2025-01-09 21:59:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846048888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:33,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:33,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006614026] [2025-01-09 21:59:33,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:33,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:59:33,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:33,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:33,657 INFO L87 Difference]: Start difference. First operand 250 states and 328 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-01-09 21:59:38,195 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-01-09 21:59:42,351 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-01-09 21:59:48,513 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-01-09 21:59:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:49,939 INFO L93 Difference]: Finished difference Result 368 states and 481 transitions. [2025-01-09 21:59:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:59:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-01-09 21:59:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:49,943 INFO L225 Difference]: With dead ends: 368 [2025-01-09 21:59:49,943 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 21:59:49,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-01-09 21:59:49,944 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 154 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:49,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 863 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 16.3s Time] [2025-01-09 21:59:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 21:59:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 21:59:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.300561797752809) internal successors, (463), 357 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:59:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 481 transitions. [2025-01-09 21:59:49,964 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 481 transitions. Word has length 10 [2025-01-09 21:59:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:49,964 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 481 transitions. [2025-01-09 21:59:49,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-01-09 21:59:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2025-01-09 21:59:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:59:49,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:49,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:49,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:59:50,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:50,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -956714940, now seen corresponding path program 1 times [2025-01-09 21:59:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:59:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702196338] [2025-01-09 21:59:50,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:50,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:50,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:50,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:50,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:59:50,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:59:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:59:50,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:59:50,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:59:50,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:50,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:59:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702196338] [2025-01-09 21:59:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702196338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:59:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485098223] [2025-01-09 21:59:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:59:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:59:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:59:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:59:50,350 INFO L87 Difference]: Start difference. First operand 368 states and 481 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 21:59:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:59:50,856 INFO L93 Difference]: Finished difference Result 418 states and 546 transitions. [2025-01-09 21:59:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:59:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-01-09 21:59:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:59:50,862 INFO L225 Difference]: With dead ends: 418 [2025-01-09 21:59:50,862 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 21:59:50,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-01-09 21:59:50,863 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 118 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 21:59:50,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 594 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 21:59:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 21:59:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 366. [2025-01-09 21:59:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.2966101694915255) internal successors, (459), 355 states have internal predecessors, (459), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:59:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 477 transitions. [2025-01-09 21:59:50,872 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 477 transitions. Word has length 23 [2025-01-09 21:59:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:59:50,872 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 477 transitions. [2025-01-09 21:59:50,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 21:59:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 477 transitions. [2025-01-09 21:59:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:59:50,873 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:59:50,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:59:50,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:59:51,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:51,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:59:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:59:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1344107650, now seen corresponding path program 1 times [2025-01-09 21:59:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:59:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800091041] [2025-01-09 21:59:51,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:59:51,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:59:51,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:59:51,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:59:51,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:59:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:59:51,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:59:51,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:59:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:59:51,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:59:51,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:59:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:59:51,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:59:51,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:59:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800091041] [2025-01-09 21:59:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800091041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:59:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:59:51,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:59:51,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466195011] [2025-01-09 21:59:51,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:59:51,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:59:51,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:59:51,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:59:51,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:59:51,343 INFO L87 Difference]: Start difference. First operand 366 states and 477 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-01-09 21:59:55,596 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-01-09 22:00:00,020 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-01-09 22:00:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:02,650 INFO L93 Difference]: Finished difference Result 418 states and 545 transitions. [2025-01-09 22:00:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:00:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-01-09 22:00:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:02,654 INFO L225 Difference]: With dead ends: 418 [2025-01-09 22:00:02,654 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 22:00:02,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:00:02,655 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:02,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 895 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 11.3s Time] [2025-01-09 22:00:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 22:00:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 362. [2025-01-09 22:00:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 1.2971428571428572) internal successors, (454), 351 states have internal predecessors, (454), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 472 transitions. [2025-01-09 22:00:02,663 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 472 transitions. Word has length 23 [2025-01-09 22:00:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:02,664 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 472 transitions. [2025-01-09 22:00:02,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-01-09 22:00:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 472 transitions. [2025-01-09 22:00:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 22:00:02,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:02,667 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:02,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:00:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:02,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1037922719, now seen corresponding path program 1 times [2025-01-09 22:00:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987389607] [2025-01-09 22:00:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:02,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:02,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:00:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 22:00:03,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 22:00:03,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:03,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:03,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:00:03,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:00:03,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:03,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987389607] [2025-01-09 22:00:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987389607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:03,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:00:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704526804] [2025-01-09 22:00:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:03,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:00:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:03,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:00:03,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:00:03,386 INFO L87 Difference]: Start difference. First operand 362 states and 472 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:03,510 INFO L93 Difference]: Finished difference Result 402 states and 512 transitions. [2025-01-09 22:00:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:00:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 143 [2025-01-09 22:00:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:03,515 INFO L225 Difference]: With dead ends: 402 [2025-01-09 22:00:03,515 INFO L226 Difference]: Without dead ends: 402 [2025-01-09 22:00:03,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01-09 22:00:03,516 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 573 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-01-09 22:00:03,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 573 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-09 22:00:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-01-09 22:00:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 390 states have (on average 1.2666666666666666) internal successors, (494), 391 states have internal predecessors, (494), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 512 transitions. [2025-01-09 22:00:03,524 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 512 transitions. Word has length 143 [2025-01-09 22:00:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:03,524 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 512 transitions. [2025-01-09 22:00:03,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 512 transitions. [2025-01-09 22:00:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 22:00:03,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:03,526 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:03,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:00:03,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:03,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:03,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 549875613, now seen corresponding path program 1 times [2025-01-09 22:00:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142413770] [2025-01-09 22:00:03,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:03,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:03,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:03,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:00:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 22:00:04,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 22:00:04,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:04,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:00:04,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:00:04,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:04,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142413770] [2025-01-09 22:00:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142413770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:00:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505046882] [2025-01-09 22:00:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:00:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:04,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:00:04,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:00:04,212 INFO L87 Difference]: Start difference. First operand 402 states and 512 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:04,341 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2025-01-09 22:00:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:00:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 143 [2025-01-09 22:00:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:04,343 INFO L225 Difference]: With dead ends: 442 [2025-01-09 22:00:04,343 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 22:00:04,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01-09 22:00:04,344 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 9 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 573 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-01-09 22:00:04,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 573 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 22:00:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 22:00:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 430 states have (on average 1.241860465116279) internal successors, (534), 431 states have internal predecessors, (534), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 552 transitions. [2025-01-09 22:00:04,351 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 552 transitions. Word has length 143 [2025-01-09 22:00:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:04,352 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 552 transitions. [2025-01-09 22:00:04,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2025-01-09 22:00:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 22:00:04,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:04,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:04,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 22:00:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:04,554 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -256496991, now seen corresponding path program 1 times [2025-01-09 22:00:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744381764] [2025-01-09 22:00:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:04,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:04,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:04,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:00:04,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 22:00:05,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 22:00:05,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:05,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:05,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:00:05,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:00:05,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:05,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744381764] [2025-01-09 22:00:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744381764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:05,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:00:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2870114] [2025-01-09 22:00:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:05,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:00:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:05,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:00:05,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:00:05,427 INFO L87 Difference]: Start difference. First operand 442 states and 552 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:09,746 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-01-09 22:00:13,752 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-01-09 22:00:19,006 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-01-09 22:00:23,014 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-01-09 22:00:24,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 22:00:30,011 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-01-09 22:00:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:31,200 INFO L93 Difference]: Finished difference Result 450 states and 560 transitions. [2025-01-09 22:00:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:00:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 143 [2025-01-09 22:00:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:31,202 INFO L225 Difference]: With dead ends: 450 [2025-01-09 22:00:31,202 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 22:00:31,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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-01-09 22:00:31,203 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 311 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:31,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 696 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 25.7s Time] [2025-01-09 22:00:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 22:00:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2025-01-09 22:00:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 431 states have (on average 1.2389791183294663) internal successors, (534), 432 states have internal predecessors, (534), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 552 transitions. [2025-01-09 22:00:31,210 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 552 transitions. Word has length 143 [2025-01-09 22:00:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:31,210 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 552 transitions. [2025-01-09 22:00:31,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 552 transitions. [2025-01-09 22:00:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 22:00:31,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:31,212 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:31,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:00:31,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:31,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -101273899, now seen corresponding path program 1 times [2025-01-09 22:00:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [237304349] [2025-01-09 22:00:31,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:31,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:31,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:31,415 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:31,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:00:31,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 22:00:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 22:00:31,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:31,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:31,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:00:31,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:00:31,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:31,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237304349] [2025-01-09 22:00:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237304349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:31,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:31,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:00:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104965836] [2025-01-09 22:00:31,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:00:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:31,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:00:31,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:00:31,933 INFO L87 Difference]: Start difference. First operand 443 states and 552 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:32,027 INFO L93 Difference]: Finished difference Result 409 states and 496 transitions. [2025-01-09 22:00:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:00:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 144 [2025-01-09 22:00:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:32,029 INFO L225 Difference]: With dead ends: 409 [2025-01-09 22:00:32,029 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 22:00:32,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-01-09 22:00:32,031 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 32 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 832 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-01-09 22:00:32,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 832 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 22:00:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-01-09 22:00:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 397 states have (on average 1.2040302267002518) internal successors, (478), 398 states have internal predecessors, (478), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 496 transitions. [2025-01-09 22:00:32,040 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 496 transitions. Word has length 144 [2025-01-09 22:00:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:32,041 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 496 transitions. [2025-01-09 22:00:32,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:00:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 496 transitions. [2025-01-09 22:00:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 22:00:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:32,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:32,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:00:32,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:32,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1422431495, now seen corresponding path program 1 times [2025-01-09 22:00:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303599029] [2025-01-09 22:00:32,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:32,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:32,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:32,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:32,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:00:32,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 22:00:32,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 22:00:32,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:32,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:00:32,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:00:32,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:32,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303599029] [2025-01-09 22:00:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303599029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:00:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209915161] [2025-01-09 22:00:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:00:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:00:32,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:00:32,756 INFO L87 Difference]: Start difference. First operand 409 states and 496 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:32,872 INFO L93 Difference]: Finished difference Result 375 states and 440 transitions. [2025-01-09 22:00:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:00:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2025-01-09 22:00:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:32,874 INFO L225 Difference]: With dead ends: 375 [2025-01-09 22:00:32,874 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 22:00:32,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-01-09 22:00:32,874 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 32 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 799 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-01-09 22:00:32,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 799 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 22:00:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-09 22:00:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 363 states have (on average 1.162534435261708) internal successors, (422), 364 states have internal predecessors, (422), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 22:00:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2025-01-09 22:00:32,882 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 144 [2025-01-09 22:00:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:32,882 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2025-01-09 22:00:32,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2025-01-09 22:00:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 22:00:32,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:32,883 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:32,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:00:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:33,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1393266837, now seen corresponding path program 1 times [2025-01-09 22:00:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111406043] [2025-01-09 22:00:33,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:33,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:33,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:33,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:33,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:00:33,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 22:00:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 22:00:33,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:33,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:33,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:00:33,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:00:33,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:00:33,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:33,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111406043] [2025-01-09 22:00:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111406043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:00:33,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:00:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:00:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011295688] [2025-01-09 22:00:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:00:33,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:00:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:33,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:00:33,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:00:33,642 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:33,716 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2025-01-09 22:00:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:00:33,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2025-01-09 22:00:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:33,719 INFO L225 Difference]: With dead ends: 378 [2025-01-09 22:00:33,719 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 22:00:33,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 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-01-09 22:00:33,720 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:33,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 857 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 22:00:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-01-09 22:00:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 365 states have (on average 1.1643835616438356) internal successors, (425), 367 states have internal predecessors, (425), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 22:00:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 446 transitions. [2025-01-09 22:00:33,730 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 446 transitions. Word has length 144 [2025-01-09 22:00:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:33,730 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 446 transitions. [2025-01-09 22:00:33,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 22:00:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 446 transitions. [2025-01-09 22:00:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 22:00:33,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:33,731 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:33,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:00:33,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:33,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:33,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:33,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1428753771, now seen corresponding path program 1 times [2025-01-09 22:00:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132726789] [2025-01-09 22:00:33,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:00:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:33,936 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:33,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:00:34,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 22:00:34,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 22:00:34,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:00:34,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:34,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:00:34,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:00:34,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:00:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 22:00:34,628 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132726789] [2025-01-09 22:00:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132726789] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:00:34,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:00:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-09 22:00:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964242195] [2025-01-09 22:00:34,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:00:34,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:00:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:34,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:00:34,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:00:34,630 INFO L87 Difference]: Start difference. First operand 378 states and 446 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:00:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:34,834 INFO L93 Difference]: Finished difference Result 389 states and 467 transitions. [2025-01-09 22:00:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:00:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-01-09 22:00:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:34,836 INFO L225 Difference]: With dead ends: 389 [2025-01-09 22:00:34,836 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 22:00:34,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 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-01-09 22:00:34,837 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 5 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:34,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 853 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:00:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 22:00:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2025-01-09 22:00:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 373 states have (on average 1.1769436997319034) internal successors, (439), 375 states have internal predecessors, (439), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2025-01-09 22:00:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 463 transitions. [2025-01-09 22:00:34,843 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 463 transitions. Word has length 148 [2025-01-09 22:00:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 463 transitions. [2025-01-09 22:00:34,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 22:00:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 463 transitions. [2025-01-09 22:00:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 22:00:34,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:34,845 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:34,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:00:35,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:35,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:35,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1978838037, now seen corresponding path program 2 times [2025-01-09 22:00:35,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:35,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039540353] [2025-01-09 22:00:35,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:00:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:35,049 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:00:35,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-01-09 22:00:35,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 22:00:35,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:00:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:00:35,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:00:35,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:00:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 22:00:35,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:00:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 22:00:35,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 22:00:35,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039540353] [2025-01-09 22:00:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039540353] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:00:35,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:00:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 22:00:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865086936] [2025-01-09 22:00:35,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:00:35,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:00:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 22:00:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:00:35,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:00:35,999 INFO L87 Difference]: Start difference. First operand 387 states and 463 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 22:00:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:00:36,353 INFO L93 Difference]: Finished difference Result 395 states and 473 transitions. [2025-01-09 22:00:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:00:36,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 156 [2025-01-09 22:00:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:00:36,355 INFO L225 Difference]: With dead ends: 395 [2025-01-09 22:00:36,356 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 22:00:36,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:00:36,356 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:00:36,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1423 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:00:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 22:00:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2025-01-09 22:00:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 377 states have (on average 1.1803713527851458) internal successors, (445), 379 states have internal predecessors, (445), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 22:00:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 466 transitions. [2025-01-09 22:00:36,363 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 466 transitions. Word has length 156 [2025-01-09 22:00:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:00:36,363 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 466 transitions. [2025-01-09 22:00:36,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 22:00:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 466 transitions. [2025-01-09 22:00:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 22:00:36,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:00:36,364 INFO L218 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 22:00:36,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:00:36,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:36,565 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:00:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:00:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1871173355, now seen corresponding path program 3 times [2025-01-09 22:00:36,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 22:00:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663908141] [2025-01-09 22:00:36,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:00:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:00:36,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:00:36,569 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:00:36,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:00:36,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 13 equivalence classes.