./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.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_SFH_test5-1.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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:04:06,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:04:06,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 22:04:06,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:04:06,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:04:06,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:04:06,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:04:06,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:04:06,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:04:06,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:04:06,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:04:06,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:04:06,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:04:06,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:04:06,563 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:04:06,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:04:06,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:04:06,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:04:06,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:04:06,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:04:06,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:04:06,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:04:06,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:04:06,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:04:06,568 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2025-01-09 22:04:06,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:04:06,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:04:06,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:04:06,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:04:06,839 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:04:06,840 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_SFH_test5-1.i [2025-01-09 22:04:08,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477e8cc1d/02a7e1fb0c3c4ab99a7b6967b72de45f/FLAGe2f95a5dd [2025-01-09 22:04:08,514 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:04:08,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-01-09 22:04:08,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477e8cc1d/02a7e1fb0c3c4ab99a7b6967b72de45f/FLAGe2f95a5dd [2025-01-09 22:04:08,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/477e8cc1d/02a7e1fb0c3c4ab99a7b6967b72de45f [2025-01-09 22:04:08,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:04:08,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:04:08,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:04:08,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:04:08,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:04:08,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:08" (1/1) ... [2025-01-09 22:04:08,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbd42f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:08, skipping insertion in model container [2025-01-09 22:04:08,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:04:08" (1/1) ... [2025-01-09 22:04:08,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:04:08,895 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 22:04:08,925 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 22:04:08,928 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 22:04:08,933 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 22:04:08,942 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 22:04:08,975 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 22:04:08,977 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 22:04: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 22:04:08,985 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 22:04:09,016 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 22:04: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 22:04:09,018 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 22:04:09,018 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 22:04:09,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:04:09,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:04:09,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:04:09,196 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:04:09,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09 WrapperNode [2025-01-09 22:04:09,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:04:09,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:04:09,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:04:09,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:04:09,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,294 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-01-09 22:04:09,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:04:09,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:04:09,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:04:09,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:04:09,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,410 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2025-01-09 22:04:09,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:04:09,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:04:09,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:04:09,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:04:09,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (1/1) ... [2025-01-09 22:04:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:04:09,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:04:09,573 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 22:04:09,576 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 22:04:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-09 22:04:09,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-09 22:04:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:04:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:04:09,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 22:04:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 22:04:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 22:04:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 22:04:09,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:04:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:04:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:04:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:04:09,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:04:09,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:04:11,618 INFO L? ?]: Removed 484 outVars from TransFormulas that were not future-live. [2025-01-09 22:04:11,619 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:04:11,644 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:04:11,648 INFO L312 CfgBuilder]: Removed 39 assume(true) statements. [2025-01-09 22:04:11,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:11 BoogieIcfgContainer [2025-01-09 22:04:11,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:04:11,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:04:11,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:04:11,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:04:11,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:04:08" (1/3) ... [2025-01-09 22:04:11,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdaa3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:11, skipping insertion in model container [2025-01-09 22:04:11,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:04:09" (2/3) ... [2025-01-09 22:04:11,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdaa3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:04:11, skipping insertion in model container [2025-01-09 22:04:11,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:04:11" (3/3) ... [2025-01-09 22:04:11,659 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2025-01-09 22:04:11,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:04:11,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 6 procedures, 576 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-01-09 22:04:11,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:04:11,727 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;@60d35cd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:04:11,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 22:04:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 568 states, 549 states have (on average 1.615664845173042) internal successors, (887), 558 states have internal predecessors, (887), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 22:04:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:04:11,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:11,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:04:11,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 61660221, now seen corresponding path program 1 times [2025-01-09 22:04:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331862166] [2025-01-09 22:04:11,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:11,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:04:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:04:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:11,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:11,920 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 22:04:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331862166] [2025-01-09 22:04:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331862166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:11,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:04:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736807782] [2025-01-09 22:04:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:11,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:04:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:11,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:04:11,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:04:11,951 INFO L87 Difference]: Start difference. First operand has 568 states, 549 states have (on average 1.615664845173042) internal successors, (887), 558 states have internal predecessors, (887), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:04:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:12,118 INFO L93 Difference]: Finished difference Result 1114 states and 1634 transitions. [2025-01-09 22:04:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:04:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-09 22:04:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:12,137 INFO L225 Difference]: With dead ends: 1114 [2025-01-09 22:04:12,138 INFO L226 Difference]: Without dead ends: 1112 [2025-01-09 22:04:12,139 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 22:04:12,142 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 783 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:12,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1730 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:04:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-01-09 22:04:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 566. [2025-01-09 22:04:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 549 states have (on average 1.4608378870673953) internal successors, (802), 556 states have internal predecessors, (802), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:04:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 826 transitions. [2025-01-09 22:04:12,231 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 826 transitions. Word has length 5 [2025-01-09 22:04:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 826 transitions. [2025-01-09 22:04:12,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:04:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 826 transitions. [2025-01-09 22:04:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 22:04:12,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:12,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:04:12,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1557039781, now seen corresponding path program 1 times [2025-01-09 22:04:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111284399] [2025-01-09 22:04:12,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:12,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 22:04:12,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 22:04:12,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:13,096 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 22:04:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111284399] [2025-01-09 22:04:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111284399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:04:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874148581] [2025-01-09 22:04:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:04:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:04:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:04:13,102 INFO L87 Difference]: Start difference. First operand 566 states and 826 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:04:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:13,225 INFO L93 Difference]: Finished difference Result 569 states and 822 transitions. [2025-01-09 22:04:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:04:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 22:04:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:13,229 INFO L225 Difference]: With dead ends: 569 [2025-01-09 22:04:13,232 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 22:04:13,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:04:13,233 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 105 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:13,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2298 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:04:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 22:04:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2025-01-09 22:04:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 549 states have (on average 1.4480874316939891) internal successors, (795), 556 states have internal predecessors, (795), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:04:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 819 transitions. [2025-01-09 22:04:13,282 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 819 transitions. Word has length 206 [2025-01-09 22:04:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:13,283 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 819 transitions. [2025-01-09 22:04:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:04:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 819 transitions. [2025-01-09 22:04:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 22:04:13,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:13,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:13,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:04:13,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:13,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1125022415, now seen corresponding path program 1 times [2025-01-09 22:04:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898820406] [2025-01-09 22:04:13,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:13,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 22:04:13,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 22:04:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:13,610 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 22:04:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898820406] [2025-01-09 22:04:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898820406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:04:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881157063] [2025-01-09 22:04:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:04:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:13,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:04:13,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:04:13,615 INFO L87 Difference]: Start difference. First operand 566 states and 819 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:04:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:13,677 INFO L93 Difference]: Finished difference Result 694 states and 1006 transitions. [2025-01-09 22:04:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:04:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-09 22:04:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:13,682 INFO L225 Difference]: With dead ends: 694 [2025-01-09 22:04:13,684 INFO L226 Difference]: Without dead ends: 694 [2025-01-09 22:04:13,685 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 22:04:13,685 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 134 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:13,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1625 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:04:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-09 22:04:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-01-09 22:04:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 677 states have (on average 1.450516986706056) internal successors, (982), 684 states have internal predecessors, (982), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:04:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1006 transitions. [2025-01-09 22:04:13,719 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1006 transitions. Word has length 206 [2025-01-09 22:04:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:13,720 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1006 transitions. [2025-01-09 22:04:13,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:04:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1006 transitions. [2025-01-09 22:04:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 22:04:13,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:13,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:13,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:04:13,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:13,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1633284976, now seen corresponding path program 1 times [2025-01-09 22:04:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260963903] [2025-01-09 22:04:13,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 22:04:13,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 22:04:13,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:13,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:04:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:14,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260963903] [2025-01-09 22:04:14,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260963903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:14,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:14,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:04:14,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081526442] [2025-01-09 22:04:14,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:14,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:04:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:14,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:04:14,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:04:14,203 INFO L87 Difference]: Start difference. First operand 694 states and 1006 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:14,302 INFO L93 Difference]: Finished difference Result 652 states and 929 transitions. [2025-01-09 22:04:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:04:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-01-09 22:04:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:14,306 INFO L225 Difference]: With dead ends: 652 [2025-01-09 22:04:14,306 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 22:04:14,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:04:14,307 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 30 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:14,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2129 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:04:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 22:04:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-01-09 22:04:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 635 states have (on average 1.4251968503937007) internal successors, (905), 642 states have internal predecessors, (905), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:04:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 929 transitions. [2025-01-09 22:04:14,336 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 929 transitions. Word has length 221 [2025-01-09 22:04:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:14,338 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 929 transitions. [2025-01-09 22:04:14,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 929 transitions. [2025-01-09 22:04:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 22:04:14,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:14,344 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:14,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:04:14,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:14,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1473417340, now seen corresponding path program 1 times [2025-01-09 22:04:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111084295] [2025-01-09 22:04:14,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:14,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 22:04:14,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 22:04:14,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:14,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:04:14,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111084295] [2025-01-09 22:04:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111084295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:04:14,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333514027] [2025-01-09 22:04:14,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:14,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:04:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:14,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:04:14,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:04:14,691 INFO L87 Difference]: Start difference. First operand 652 states and 929 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:14,744 INFO L93 Difference]: Finished difference Result 652 states and 926 transitions. [2025-01-09 22:04:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:04:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-01-09 22:04:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:14,747 INFO L225 Difference]: With dead ends: 652 [2025-01-09 22:04:14,748 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 22:04:14,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:04:14,750 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:14,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1434 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:04:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 22:04:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2025-01-09 22:04:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 635 states have (on average 1.420472440944882) internal successors, (902), 642 states have internal predecessors, (902), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 22:04:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 926 transitions. [2025-01-09 22:04:14,772 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 926 transitions. Word has length 221 [2025-01-09 22:04:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:14,773 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 926 transitions. [2025-01-09 22:04:14,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 926 transitions. [2025-01-09 22:04:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 22:04:14,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:14,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:04:14,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash -679689478, now seen corresponding path program 1 times [2025-01-09 22:04:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:14,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234540123] [2025-01-09 22:04:14,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:14,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 22:04:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 22:04:14,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:14,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 22:04:15,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:15,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234540123] [2025-01-09 22:04:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234540123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:04:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:04:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012196885] [2025-01-09 22:04:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:15,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:04:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:15,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:04:15,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:04:15,132 INFO L87 Difference]: Start difference. First operand 652 states and 926 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:15,195 INFO L93 Difference]: Finished difference Result 944 states and 1343 transitions. [2025-01-09 22:04:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:04:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 221 [2025-01-09 22:04:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:15,200 INFO L225 Difference]: With dead ends: 944 [2025-01-09 22:04:15,200 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 22:04:15,200 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 22:04:15,201 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 455 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:15,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1647 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:04:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 22:04:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 941. [2025-01-09 22:04:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 916 states have (on average 1.4203056768558953) internal successors, (1301), 928 states have internal predecessors, (1301), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 22:04:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1341 transitions. [2025-01-09 22:04:15,224 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1341 transitions. Word has length 221 [2025-01-09 22:04:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1341 transitions. [2025-01-09 22:04:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:04:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1341 transitions. [2025-01-09 22:04:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 22:04:15,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:15,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:04:15,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1899486423, now seen corresponding path program 1 times [2025-01-09 22:04:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344023354] [2025-01-09 22:04:15,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:15,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:15,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344023354] [2025-01-09 22:04:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344023354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:04:15,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499100824] [2025-01-09 22:04:15,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:15,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:04:15,697 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 22:04:15,699 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 22:04:16,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:16,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:16,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:16,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:16,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:04:16,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:04:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 22:04:16,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:04:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499100824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:04:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 22:04:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204486312] [2025-01-09 22:04:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:04:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:16,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:04:16,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:04:16,350 INFO L87 Difference]: Start difference. First operand 941 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:04:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:16,437 INFO L93 Difference]: Finished difference Result 981 states and 1381 transitions. [2025-01-09 22:04:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:04:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 236 [2025-01-09 22:04:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:16,442 INFO L225 Difference]: With dead ends: 981 [2025-01-09 22:04:16,443 INFO L226 Difference]: Without dead ends: 981 [2025-01-09 22:04:16,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:04:16,444 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 8 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1413 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:04:16,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1413 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:04:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-01-09 22:04:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-01-09 22:04:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 956 states have (on average 1.4027196652719665) internal successors, (1341), 968 states have internal predecessors, (1341), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 22:04:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1381 transitions. [2025-01-09 22:04:16,473 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1381 transitions. Word has length 236 [2025-01-09 22:04:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:16,473 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1381 transitions. [2025-01-09 22:04:16,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:04:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1381 transitions. [2025-01-09 22:04:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 22:04:16,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:16,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:16,488 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 22:04:16,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:16,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash -870127125, now seen corresponding path program 1 times [2025-01-09 22:04:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700856449] [2025-01-09 22:04:16,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:16,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:16,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:16,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700856449] [2025-01-09 22:04:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700856449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:04:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787677488] [2025-01-09 22:04:17,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:04:17,114 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 22:04:17,116 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 22:04:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:17,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:17,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:17,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:04:17,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:04:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 22:04:17,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:04:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787677488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:04:17,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:04:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 22:04:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231189390] [2025-01-09 22:04:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:04:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:04:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:17,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:04:17,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:04:17,717 INFO L87 Difference]: Start difference. First operand 981 states and 1381 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:04:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:17,792 INFO L93 Difference]: Finished difference Result 953 states and 1339 transitions. [2025-01-09 22:04:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:04:17,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 236 [2025-01-09 22:04:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:17,796 INFO L225 Difference]: With dead ends: 953 [2025-01-09 22:04:17,796 INFO L226 Difference]: Without dead ends: 953 [2025-01-09 22:04:17,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:04:17,797 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 105 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:17,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2028 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:04:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-01-09 22:04:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2025-01-09 22:04:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 928 states have (on average 1.3997844827586208) internal successors, (1299), 940 states have internal predecessors, (1299), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 22:04:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1339 transitions. [2025-01-09 22:04:17,819 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1339 transitions. Word has length 236 [2025-01-09 22:04:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:17,820 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1339 transitions. [2025-01-09 22:04:17,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 22:04:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1339 transitions. [2025-01-09 22:04:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 22:04:17,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:17,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:17,834 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 22:04:18,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:18,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1165622243, now seen corresponding path program 1 times [2025-01-09 22:04:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042404909] [2025-01-09 22:04:18,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:18,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:18,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:18,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:18,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042404909] [2025-01-09 22:04:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042404909] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:04:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52775897] [2025-01-09 22:04:18,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:04:18,367 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 22:04:18,368 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 22:04:18,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 22:04:18,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 22:04:18,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:18,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:18,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:04:18,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:04:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:19,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:04:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52775897] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:04:19,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:04:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 22:04:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017146784] [2025-01-09 22:04:19,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:04:19,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:04:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:04:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:04:19,469 INFO L87 Difference]: Start difference. First operand 953 states and 1339 transitions. Second operand has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 22:04:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:19,661 INFO L93 Difference]: Finished difference Result 2206 states and 3109 transitions. [2025-01-09 22:04:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:04:19,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 236 [2025-01-09 22:04:19,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:19,672 INFO L225 Difference]: With dead ends: 2206 [2025-01-09 22:04:19,673 INFO L226 Difference]: Without dead ends: 2206 [2025-01-09 22:04:19,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:04:19,675 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 2983 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3014 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:19,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3014 Valid, 2982 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:04:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-01-09 22:04:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1885. [2025-01-09 22:04:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1835 states have (on average 1.389100817438692) internal successors, (2549), 1857 states have internal predecessors, (2549), 46 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (44), 28 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 22:04:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2639 transitions. [2025-01-09 22:04:19,736 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2639 transitions. Word has length 236 [2025-01-09 22:04:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:19,737 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2639 transitions. [2025-01-09 22:04:19,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.57142857142857) internal successors, (529), 7 states have internal predecessors, (529), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 22:04:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2639 transitions. [2025-01-09 22:04:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-01-09 22:04:19,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:19,749 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:19,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:04:19,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:19,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1693160426, now seen corresponding path program 1 times [2025-01-09 22:04:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126710860] [2025-01-09 22:04:19,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:20,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-01-09 22:04:20,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-01-09 22:04:20,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 4 proven. 526 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-01-09 22:04:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:04:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126710860] [2025-01-09 22:04:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126710860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:04:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656191441] [2025-01-09 22:04:21,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:21,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:04:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:04:21,346 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 22:04:21,348 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 22:04:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-01-09 22:04:22,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-01-09 22:04:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:04:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:04:22,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 3260 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:04:22,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:04:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:23,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:04:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 22:04:23,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656191441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:04:23,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:04:23,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 22:04:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730426443] [2025-01-09 22:04:23,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:04:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:04:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:04:23,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:04:23,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:04:23,967 INFO L87 Difference]: Start difference. First operand 1885 states and 2639 transitions. Second operand has 16 states, 16 states have (on average 102.75) internal successors, (1644), 16 states have internal predecessors, (1644), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 22:04:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:04:34,591 INFO L93 Difference]: Finished difference Result 15734 states and 22227 transitions. [2025-01-09 22:04:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 22:04:34,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 102.75) internal successors, (1644), 16 states have internal predecessors, (1644), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 668 [2025-01-09 22:04:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:04:34,649 INFO L225 Difference]: With dead ends: 15734 [2025-01-09 22:04:34,650 INFO L226 Difference]: Without dead ends: 15734 [2025-01-09 22:04:34,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1394 GetRequests, 1326 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 22:04:34,651 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 36425 mSDsluCounter, 14563 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36425 SdHoareTripleChecker+Valid, 16175 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:04:34,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36425 Valid, 16175 Invalid, 2746 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [377 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2025-01-09 22:04:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15734 states. [2025-01-09 22:04:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15734 to 11182. [2025-01-09 22:04:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11182 states, 10990 states have (on average 1.3883530482256596) internal successors, (15258), 11067 states have internal predecessors, (15258), 188 states have call successors, (188), 3 states have call predecessors, (188), 2 states have return successors, (186), 126 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 22:04:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11182 states to 11182 states and 15632 transitions. [2025-01-09 22:04:34,922 INFO L78 Accepts]: Start accepts. Automaton has 11182 states and 15632 transitions. Word has length 668 [2025-01-09 22:04:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:04:34,923 INFO L471 AbstractCegarLoop]: Abstraction has 11182 states and 15632 transitions. [2025-01-09 22:04:34,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 102.75) internal successors, (1644), 16 states have internal predecessors, (1644), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 22:04:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 11182 states and 15632 transitions. [2025-01-09 22:04:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-01-09 22:04:35,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:04:35,007 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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] [2025-01-09 22:04:35,026 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:04:35,211 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,SelfDestructingSolverStorable9 [2025-01-09 22:04:35,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 22:04:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:04:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1245861619, now seen corresponding path program 1 times [2025-01-09 22:04:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:04:35,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005395490] [2025-01-09 22:04:35,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:04:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:04:35,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes.