./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d 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/verifythis/tree_max.c -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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:49:46,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:49:46,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:49:46,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:49:46,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:49:46,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:49:46,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:49:46,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:49:46,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:49:46,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:49:46,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:49:46,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:49:46,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:49:46,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:49:46,877 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:49:46,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:49:46,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:49:46,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:46,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:49:46,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:49:46,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:49:46,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:49:46,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:49:46,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:49:46,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:49:46,881 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2025-02-08 05:49:47,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:49:47,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:49:47,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:49:47,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:49:47,120 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:49:47,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2025-02-08 05:49:48,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e571b3fc/801e1c7bfe7844408c9c9e789bf61f10/FLAGe3283f91d [2025-02-08 05:49:48,462 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:49:48,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-02-08 05:49:48,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e571b3fc/801e1c7bfe7844408c9c9e789bf61f10/FLAGe3283f91d [2025-02-08 05:49:48,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e571b3fc/801e1c7bfe7844408c9c9e789bf61f10 [2025-02-08 05:49:48,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:49:48,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:49:48,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:48,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:49:48,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:49:48,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:48,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaa85da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48, skipping insertion in model container [2025-02-08 05:49:48,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:48,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:49:48,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-02-08 05:49:48,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:48,950 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:49:48,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:48,980 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:49:48,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48 WrapperNode [2025-02-08 05:49:48,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:48,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:48,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:49:48,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:49:48,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:48,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,004 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 40 [2025-02-08 05:49:49,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:49,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:49:49,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:49:49,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:49:49,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,024 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 05:49:49,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:49:49,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:49:49,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:49:49,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:49:49,044 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (1/1) ... [2025-02-08 05:49:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:49,072 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-02-08 05:49:49,077 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-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-02-08 05:49:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-02-08 05:49:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-02-08 05:49:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:49:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:49:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:49:49,149 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:49:49,150 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:49:49,232 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc ~a~0, ~b~0, ~c~0; [2025-02-08 05:49:49,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc ~n~0.base, ~n~0.offset; [2025-02-08 05:49:49,307 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-08 05:49:49,308 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:49:49,316 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:49:49,317 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:49:49,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:49 BoogieIcfgContainer [2025-02-08 05:49:49,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:49:49,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:49:49,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:49:49,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:49:49,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:49:48" (1/3) ... [2025-02-08 05:49:49,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2afd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:49, skipping insertion in model container [2025-02-08 05:49:49,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:48" (2/3) ... [2025-02-08 05:49:49,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2afd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:49, skipping insertion in model container [2025-02-08 05:49:49,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:49" (3/3) ... [2025-02-08 05:49:49,326 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-02-08 05:49:49,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:49:49,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_max.c that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 05:49:49,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:49:49,379 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;@92a466b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:49:49,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:49:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 05:49:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 05:49:49,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:49,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:49,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:49,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1771487517, now seen corresponding path program 1 times [2025-02-08 05:49:49,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170518579] [2025-02-08 05:49:49,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:49,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:49,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 05:49:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 05:49:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170518579] [2025-02-08 05:49:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170518579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:49:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711786772] [2025-02-08 05:49:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:49,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:49:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:49,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:49:49,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:49,783 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 05:49:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:49,853 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-02-08 05:49:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-08 05:49:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:49,860 INFO L225 Difference]: With dead ends: 53 [2025-02-08 05:49:49,861 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 05:49:49,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:49,865 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:49,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 05:49:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-08 05:49:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-02-08 05:49:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2025-02-08 05:49:49,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 18 [2025-02-08 05:49:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:49,900 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2025-02-08 05:49:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 05:49:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2025-02-08 05:49:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 05:49:49,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:49,901 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] [2025-02-08 05:49:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:49:49,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1593557238, now seen corresponding path program 1 times [2025-02-08 05:49:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-02-08 05:49:49,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:49,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:49,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:49:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:49:49,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:49,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-02-08 05:49:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859649173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:49:49,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917970624] [2025-02-08 05:49:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:49,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:49:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:49:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:49:49,956 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 05:49:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:50,071 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-02-08 05:49:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:49:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2025-02-08 05:49:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:50,072 INFO L225 Difference]: With dead ends: 52 [2025-02-08 05:49:50,072 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 05:49:50,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:49:50,073 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:50,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 33 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 05:49:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 05:49:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2025-02-08 05:49:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2025-02-08 05:49:50,077 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 20 [2025-02-08 05:49:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:50,078 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-02-08 05:49:50,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 05:49:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2025-02-08 05:49:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 05:49:50,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:50,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:49:50,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:50,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -110427607, now seen corresponding path program 1 times [2025-02-08 05:49:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772718651] [2025-02-08 05:49:50,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:49:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:49:50,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:50,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:49:50,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772718651] [2025-02-08 05:49:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772718651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:50,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:50,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:49:50,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779671869] [2025-02-08 05:49:50,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:50,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:50,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:50,231 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:49:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:50,275 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2025-02-08 05:49:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:49:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2025-02-08 05:49:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:50,276 INFO L225 Difference]: With dead ends: 44 [2025-02-08 05:49:50,276 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 05:49:50,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:50,277 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:50,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 05:49:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 05:49:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-02-08 05:49:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2025-02-08 05:49:50,281 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 30 [2025-02-08 05:49:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:50,281 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-02-08 05:49:50,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:49:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2025-02-08 05:49:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 05:49:50,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:50,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-08 05:49:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:49:50,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:50,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1959537131, now seen corresponding path program 1 times [2025-02-08 05:49:50,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:50,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567005349] [2025-02-08 05:49:50,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:50,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:49:50,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:49:50,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:50,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:49:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567005349] [2025-02-08 05:49:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567005349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396638896] [2025-02-08 05:49:50,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:50,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:50,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:50,832 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-02-08 05:49:50,840 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-02-08 05:49:50,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:49:50,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:49:50,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:50,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:50,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 05:49:50,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:51,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 05:49:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 05:49:51,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:51,385 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-08 05:49:51,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-08 05:49:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396638896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:51,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 22 [2025-02-08 05:49:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612042417] [2025-02-08 05:49:51,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:51,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 05:49:51,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:51,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 05:49:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-02-08 05:49:51,413 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 states have internal predecessors, (39), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-08 05:49:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:51,838 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2025-02-08 05:49:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:49:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 states have internal predecessors, (39), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 43 [2025-02-08 05:49:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:51,840 INFO L225 Difference]: With dead ends: 55 [2025-02-08 05:49:51,840 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 05:49:51,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-02-08 05:49:51,841 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:51,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 177 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:49:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 05:49:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 05:49:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 39 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-08 05:49:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-02-08 05:49:51,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 43 [2025-02-08 05:49:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-02-08 05:49:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 17 states have internal predecessors, (39), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-08 05:49:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-02-08 05:49:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 05:49:51,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:51,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-08 05:49:51,853 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-02-08 05:49:52,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:52,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1918404626, now seen corresponding path program 1 times [2025-02-08 05:49:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:52,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-02-08 05:49:52,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:52,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:52,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:49:52,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:49:52,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:52,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 05:49:52,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207686726] [2025-02-08 05:49:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207686726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:49:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596250863] [2025-02-08 05:49:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:52,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:52,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:52,137 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 05:49:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:52,174 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2025-02-08 05:49:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:49:52,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2025-02-08 05:49:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:52,175 INFO L225 Difference]: With dead ends: 59 [2025-02-08 05:49:52,175 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 05:49:52,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:52,176 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:52,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 05:49:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-02-08 05:49:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-08 05:49:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2025-02-08 05:49:52,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 45 [2025-02-08 05:49:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:52,181 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2025-02-08 05:49:52,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 05:49:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2025-02-08 05:49:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 05:49:52,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:52,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:52,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:49:52,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:52,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 319126990, now seen corresponding path program 1 times [2025-02-08 05:49:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-02-08 05:49:52,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:52,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:49:52,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:52,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:52,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:49:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449960042] [2025-02-08 05:49:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449960042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114354667] [2025-02-08 05:49:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:52,742 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-02-08 05:49:52,744 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-02-08 05:49:52,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:49:52,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:52,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:52,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-08 05:49:52,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:52,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:49:52,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 05:49:52,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-08 05:49:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:49:53,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 05:49:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 05:49:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114354667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:54,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:54,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 47 [2025-02-08 05:49:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51358544] [2025-02-08 05:49:54,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 05:49:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:54,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 05:49:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1996, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 05:49:54,057 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 47 states, 40 states have (on average 2.0) internal successors, (80), 37 states have internal predecessors, (80), 16 states have call successors, (19), 9 states have call predecessors, (19), 14 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2025-02-08 05:49:59,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:50:03,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:50:07,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:50:11,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:50:15,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:50:19,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:51:03,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:51:07,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-08 05:51:11,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]