./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/tree_max.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:10:17,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:10:17,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:10:17,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:10:17,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:10:17,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:10:17,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:10:17,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:10:17,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:10:17,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:10:17,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:10:17,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:10:17,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:10:17,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:10:17,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:10:17,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:10:17,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:10:17,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:10:17,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:10:17,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:10:17,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:10:17,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:10:17,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:10:17,914 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:10:17,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:10:17,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:10:17,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:10:17,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:10:17,916 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:10:17,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:10:17,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:10:17,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:10:17,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:10:17,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:10:17,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:10:17,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:10:17,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:10:17,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:10:17,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:10:17,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:10:17,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2024-11-19 06:10:18,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:10:18,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:10:18,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:10:18,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:10:18,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:10:18,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2024-11-19 06:10:19,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:10:19,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:10:19,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2024-11-19 06:10:19,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65dcb97b/73417f4ffcbb4d76a5d4427a40fb14df/FLAG5948daebe [2024-11-19 06:10:19,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e65dcb97b/73417f4ffcbb4d76a5d4427a40fb14df [2024-11-19 06:10:19,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:10:19,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:10:19,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:10:19,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:10:19,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:10:19,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd389e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19, skipping insertion in model container [2024-11-19 06:10:19,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:10:19,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:10:19,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:10:19,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:10:19,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:10:19,720 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:10:19,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19 WrapperNode [2024-11-19 06:10:19,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:10:19,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:10:19,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:10:19,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:10:19,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,748 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 40 [2024-11-19 06:10:19,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:10:19,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:10:19,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:10:19,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:10:19,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,778 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]. [2024-11-19 06:10:19,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:10:19,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:10:19,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:10:19,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:10:19,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (1/1) ... [2024-11-19 06:10:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:10:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:19,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:10:19,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:10:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:10:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:10:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-11-19 06:10:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-19 06:10:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-19 06:10:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:10:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:10:19,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:10:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:10:19,936 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:10:19,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:10:20,081 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-19 06:10:20,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:10:20,090 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:10:20,090 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 06:10:20,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:10:20 BoogieIcfgContainer [2024-11-19 06:10:20,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:10:20,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:10:20,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:10:20,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:10:20,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:10:19" (1/3) ... [2024-11-19 06:10:20,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f42846d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:10:20, skipping insertion in model container [2024-11-19 06:10:20,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:10:19" (2/3) ... [2024-11-19 06:10:20,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f42846d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:10:20, skipping insertion in model container [2024-11-19 06:10:20,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:10:20" (3/3) ... [2024-11-19 06:10:20,097 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2024-11-19 06:10:20,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:10:20,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:10:20,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:10:20,153 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;@28ad6b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:10:20,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:10:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 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) [2024-11-19 06:10:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:10:20,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:20,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:20,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1784882872, now seen corresponding path program 1 times [2024-11-19 06:10:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080306468] [2024-11-19 06:10:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:10:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080306468] [2024-11-19 06:10:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080306468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:20,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:10:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:10:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429063700] [2024-11-19 06:10:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:20,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:10:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:10:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:10:20,598 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 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 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-19 06:10:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:20,662 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-19 06:10:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:10:20,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 19 [2024-11-19 06:10:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:20,671 INFO L225 Difference]: With dead ends: 54 [2024-11-19 06:10:20,671 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:10:20,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:10:20,675 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 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 [2024-11-19 06:10:20,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:10:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:10:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-19 06:10:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 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) [2024-11-19 06:10:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-19 06:10:20,704 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 19 [2024-11-19 06:10:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:20,705 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-19 06:10:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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) [2024-11-19 06:10:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2024-11-19 06:10:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:10:20,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:20,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:10:20,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:20,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1558539456, now seen corresponding path program 1 times [2024-11-19 06:10:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814802390] [2024-11-19 06:10:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:10:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814802390] [2024-11-19 06:10:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814802390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:20,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:10:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:10:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78193925] [2024-11-19 06:10:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:20,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:10:20,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:10:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:10:20,767 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-19 06:10:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:20,873 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-19 06:10:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:10:20,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2024-11-19 06:10:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:20,875 INFO L225 Difference]: With dead ends: 53 [2024-11-19 06:10:20,875 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 06:10:20,876 INFO L431 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 [2024-11-19 06:10:20,877 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:20,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:10:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 06:10:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-19 06:10:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 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) [2024-11-19 06:10:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-19 06:10:20,885 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2024-11-19 06:10:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:20,886 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-19 06:10:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-19 06:10:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-19 06:10:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:10:20,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:20,889 INFO L215 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, 1] [2024-11-19 06:10:20,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:10:20,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:20,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -583725959, now seen corresponding path program 1 times [2024-11-19 06:10:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196885765] [2024-11-19 06:10:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 06:10:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196885765] [2024-11-19 06:10:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196885765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:21,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:10:21,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:10:21,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77314724] [2024-11-19 06:10:21,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:10:21,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:21,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:10:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:10:21,050 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-19 06:10:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:21,102 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-11-19 06:10:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:10:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 31 [2024-11-19 06:10:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:21,105 INFO L225 Difference]: With dead ends: 45 [2024-11-19 06:10:21,106 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 06:10:21,106 INFO L431 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 [2024-11-19 06:10:21,107 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 303 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 [2024-11-19 06:10:21,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:10:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 06:10:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 06:10:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 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) [2024-11-19 06:10:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-11-19 06:10:21,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 31 [2024-11-19 06:10:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:21,116 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-11-19 06:10:21,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-19 06:10:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-19 06:10:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:10:21,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:21,119 INFO L215 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] [2024-11-19 06:10:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:10:21,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1389688533, now seen corresponding path program 1 times [2024-11-19 06:10:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507190899] [2024-11-19 06:10:21,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:10:21,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:21,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507190899] [2024-11-19 06:10:21,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507190899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:21,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402133438] [2024-11-19 06:10:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:21,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:21,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:21,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:21,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:10:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:21,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:10:21,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:22,091 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 [2024-11-19 06:10:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:10:22,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:22,317 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 06:10:22,317 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 [2024-11-19 06:10:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:10:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402133438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:22,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 22 [2024-11-19 06:10:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686297187] [2024-11-19 06:10:22,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 06:10:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 06:10:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-19 06:10:22,363 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 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) [2024-11-19 06:10:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:22,796 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-19 06:10:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:10:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 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 44 [2024-11-19 06:10:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:22,798 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:10:22,799 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:10:22,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:10:22,802 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:22,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:10:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:10:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 06:10:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 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) [2024-11-19 06:10:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2024-11-19 06:10:22,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 44 [2024-11-19 06:10:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:22,810 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2024-11-19 06:10:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 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) [2024-11-19 06:10:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2024-11-19 06:10:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:10:22,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:22,816 INFO L215 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, 1] [2024-11-19 06:10:22,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:10:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:23,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:23,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 266098275, now seen corresponding path program 1 times [2024-11-19 06:10:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673471272] [2024-11-19 06:10:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:10:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673471272] [2024-11-19 06:10:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673471272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577279480] [2024-11-19 06:10:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:23,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:23,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:23,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:10:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:23,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:10:23,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 06:10:23,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:10:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577279480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:10:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:10:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2024-11-19 06:10:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651892186] [2024-11-19 06:10:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:10:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:10:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:10:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:10:23,316 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-19 06:10:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:23,352 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2024-11-19 06:10:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:10:23,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 46 [2024-11-19 06:10:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:23,353 INFO L225 Difference]: With dead ends: 60 [2024-11-19 06:10:23,353 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 06:10:23,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:10:23,354 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 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 [2024-11-19 06:10:23,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:10:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 06:10:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-19 06:10:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 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) [2024-11-19 06:10:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-11-19 06:10:23,363 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 46 [2024-11-19 06:10:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:23,363 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-11-19 06:10:23,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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) [2024-11-19 06:10:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-11-19 06:10:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:10:23,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:23,365 INFO L215 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, 1] [2024-11-19 06:10:23,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:10:23,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:23,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash 358548016, now seen corresponding path program 1 times [2024-11-19 06:10:23,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892260997] [2024-11-19 06:10:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:23,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:10:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:23,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892260997] [2024-11-19 06:10:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892260997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:23,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662072316] [2024-11-19 06:10:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:23,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:23,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:10:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:23,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:10:23,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:23,997 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 [2024-11-19 06:10:24,001 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 [2024-11-19 06:10:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:10:24,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 06:10:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662072316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:24,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 20 [2024-11-19 06:10:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006909650] [2024-11-19 06:10:24,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:24,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:10:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:10:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:10:24,409 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 06:10:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:24,690 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-19 06:10:24,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:10:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2024-11-19 06:10:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:24,692 INFO L225 Difference]: With dead ends: 108 [2024-11-19 06:10:24,692 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:10:24,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:10:24,693 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:24,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 488 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:10:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:10:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2024-11-19 06:10:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 19 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (28), 20 states have call predecessors, (28), 19 states have call successors, (28) [2024-11-19 06:10:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2024-11-19 06:10:24,705 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 50 [2024-11-19 06:10:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:24,705 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2024-11-19 06:10:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 06:10:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2024-11-19 06:10:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 06:10:24,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:24,710 INFO L215 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, 1] [2024-11-19 06:10:24,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:24,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:24,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 242184370, now seen corresponding path program 1 times [2024-11-19 06:10:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025740606] [2024-11-19 06:10:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:10:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025740606] [2024-11-19 06:10:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025740606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003708154] [2024-11-19 06:10:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:25,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:25,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:10:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:10:25,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 06:10:25,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:25,460 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 [2024-11-19 06:10:25,463 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 [2024-11-19 06:10:25,534 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 [2024-11-19 06:10:25,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-19 06:10:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:10:25,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 06:10:26,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003708154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:26,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 29 [2024-11-19 06:10:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866704771] [2024-11-19 06:10:26,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:10:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:10:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2024-11-19 06:10:26,105 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 06:10:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:27,252 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-11-19 06:10:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-19 06:10:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 50 [2024-11-19 06:10:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:27,255 INFO L225 Difference]: With dead ends: 206 [2024-11-19 06:10:27,255 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:10:27,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 06:10:27,260 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 190 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:27,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 348 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:10:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:10:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2024-11-19 06:10:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 140 states have internal predecessors, (165), 35 states have call successors, (35), 17 states have call predecessors, (35), 25 states have return successors, (68), 39 states have call predecessors, (68), 35 states have call successors, (68) [2024-11-19 06:10:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2024-11-19 06:10:27,276 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 50 [2024-11-19 06:10:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:27,277 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2024-11-19 06:10:27,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 06:10:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2024-11-19 06:10:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 06:10:27,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:27,283 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-19 06:10:27,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:10:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:27,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -677748063, now seen corresponding path program 2 times [2024-11-19 06:10:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836033774] [2024-11-19 06:10:27,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:27,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:27,505 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 06:10:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:10:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836033774] [2024-11-19 06:10:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836033774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:10:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050766490] [2024-11-19 06:10:28,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:10:28,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:28,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:10:28,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:10:28,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:10:28,131 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:10:28,131 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:10:28,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 06:10:28,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:10:28,163 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 19 treesize of output 1 [2024-11-19 06:10:28,166 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 [2024-11-19 06:10:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-19 06:10:28,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:10:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-19 06:10:29,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050766490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:10:29,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:10:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 43 [2024-11-19 06:10:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533086410] [2024-11-19 06:10:29,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:10:29,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 06:10:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:10:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 06:10:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 06:10:29,012 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-19 06:10:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:10:29,503 INFO L93 Difference]: Finished difference Result 296 states and 406 transitions. [2024-11-19 06:10:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:10:29,504 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) Word has length 62 [2024-11-19 06:10:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:10:29,506 INFO L225 Difference]: With dead ends: 296 [2024-11-19 06:10:29,506 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 06:10:29,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:10:29,507 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:10:29,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 790 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:10:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 06:10:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 241. [2024-11-19 06:10:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 167 states have (on average 1.215568862275449) internal successors, (203), 172 states have internal predecessors, (203), 41 states have call successors, (41), 21 states have call predecessors, (41), 31 states have return successors, (82), 47 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-19 06:10:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 326 transitions. [2024-11-19 06:10:29,522 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 326 transitions. Word has length 62 [2024-11-19 06:10:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:10:29,523 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 326 transitions. [2024-11-19 06:10:29,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-19 06:10:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 326 transitions. [2024-11-19 06:10:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 06:10:29,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:10:29,524 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:29,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:10:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:10:29,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:10:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:10:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1572615861, now seen corresponding path program 1 times [2024-11-19 06:10:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:10:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025372085] [2024-11-19 06:10:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:10:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:10:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:10:29,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:10:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:10:29,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:10:29,781 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:10:29,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-19 06:10:29,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-19 06:10:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:10:29,785 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:10:29,812 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:10:29,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:10:29 BoogieIcfgContainer [2024-11-19 06:10:29,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:10:29,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:10:29,818 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:10:29,818 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:10:29,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:10:20" (3/4) ... [2024-11-19 06:10:29,819 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:10:29,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:10:29,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:10:29,858 INFO L158 Benchmark]: Toolchain (without parser) took 10336.34ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 157.1MB in the beginning and 191.9MB in the end (delta: -34.8MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,858 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:10:29,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.78ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 144.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.65ms. Allocated memory is still 186.6MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,859 INFO L158 Benchmark]: Boogie Preprocessor took 47.15ms. Allocated memory is still 186.6MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,859 INFO L158 Benchmark]: RCFGBuilder took 293.44ms. Allocated memory is still 186.6MB. Free memory was 140.4MB in the beginning and 124.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,859 INFO L158 Benchmark]: TraceAbstraction took 9725.07ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 123.6MB in the beginning and 195.1MB in the end (delta: -71.5MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,860 INFO L158 Benchmark]: Witness Printer took 39.92ms. Allocated memory is still 325.1MB. Free memory was 195.1MB in the beginning and 191.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:10:29,861 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.78ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 144.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.65ms. Allocated memory is still 186.6MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.15ms. Allocated memory is still 186.6MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 293.44ms. Allocated memory is still 186.6MB. Free memory was 140.4MB in the beginning and 124.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9725.07ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 123.6MB in the beginning and 195.1MB in the end (delta: -71.5MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 39.92ms. Allocated memory is still 325.1MB. Free memory was 195.1MB in the beginning and 191.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L66] CALL, EXPR nondet_tree() [L24] COND FALSE !(__VERIFIER_nondet_bool()) [L27] struct node *n = (struct node *)malloc(sizeof(struct node)); [L28] n->data = __VERIFIER_nondet_int() [L29] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [n={-1:0}] [L29] n->left = nondet_tree() [L30] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->right = nondet_tree() [L31] return n; VAL [\result={-1:0}] [L66] RET, EXPR nondet_tree() [L66] CALL task(nondet_tree()) [L61] CALL, EXPR max(n) VAL [\old(n)={-1:0}] [L36] COND FALSE !(!n) [L39] EXPR n->data [L39] int a = n->data; [L40] EXPR n->left VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] CALL, EXPR max(n->left) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L40] RET, EXPR max(n->left) VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] int b = max(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] CALL, EXPR max(n->right) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L41] RET, EXPR max(n->right) VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] int c = max(n->right); [L42] COND TRUE b >= a && b >= c [L42] return b; VAL [\old(n)={-1:0}, \result=-2147483648] [L61] RET, EXPR max(n) VAL [n={-1:0}] [L61] int a = max(n); [L62] CALL check(n, a) [L49] COND TRUE \read(*n) [L50] EXPR n->data [L50] CALL __VERIFIER_assert(n->data <= a) [L15] COND FALSE !(!cond) [L50] RET __VERIFIER_assert(n->data <= a) [L52] COND FALSE !(__VERIFIER_nondet_bool()) [L55] EXPR n->right VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L55] CALL check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={0:0}] [L49] COND FALSE !(\read(*n)) [L55] RET check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L62] RET check(n, a) VAL [a=-2147483648, n={-1:0}] [L66] RET task(nondet_tree()) - UnprovableResult [Line: 13]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 2752 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2473 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3007 IncrementalHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 279 mSDtfsCounter, 3007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 416 SyntacticMatches, 9 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 764 ConstructedInterpolants, 65 QuantifiedInterpolants, 4968 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 399/471 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 06:10:29,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)