./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test03.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0461c64dd33aab490c540600717644b0e8e89b40b72a49b75f3cca81071b4ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:15:38,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:15:38,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:15:38,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:15:38,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:15:38,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:15:38,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:15:38,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:15:38,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:15:38,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:15:38,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:15:38,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:15:38,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:15:38,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:15:38,822 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:15:38,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:15:38,823 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:15:38,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:15:38,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:38,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:15:38,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:38,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:15:38,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:15:38,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:15:38,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:15:38,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:15:38,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:15:38,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:15:38,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:15:38,827 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b0461c64dd33aab490c540600717644b0e8e89b40b72a49b75f3cca81071b4ad [2025-01-09 22:15:39,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:15:39,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:15:39,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:15:39,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:15:39,111 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:15:39,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test03.c [2025-01-09 22:15:40,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30434a0c3/a620a0050386494dbc145574171cfb0a/FLAG9cc62cd7d [2025-01-09 22:15:40,602 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:15:40,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test03.c [2025-01-09 22:15:40,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30434a0c3/a620a0050386494dbc145574171cfb0a/FLAG9cc62cd7d [2025-01-09 22:15:40,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30434a0c3/a620a0050386494dbc145574171cfb0a [2025-01-09 22:15:40,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:15:40,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:15:40,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:40,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:15:40,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:15:40,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b88f691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40, skipping insertion in model container [2025-01-09 22:15:40,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:15:40,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:40,844 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:15:40,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:15:40,869 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:15:40,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40 WrapperNode [2025-01-09 22:15:40,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:15:40,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:40,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:15:40,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:15:40,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,897 INFO L138 Inliner]: procedures = 13, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-01-09 22:15:40,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:15:40,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:15:40,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:15:40,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:15:40,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,927 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 22:15:40,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:15:40,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:15:40,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:15:40,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:15:40,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (1/1) ... [2025-01-09 22:15:40,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:15:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:15:40,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:15:40,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:15:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:15:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:15:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:15:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:15:41,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:15:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:15:41,081 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:15:41,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:15:41,204 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-09 22:15:41,204 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:15:41,211 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:15:41,212 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:15:41,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:41 BoogieIcfgContainer [2025-01-09 22:15:41,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:15:41,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:15:41,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:15:41,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:15:41,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:15:40" (1/3) ... [2025-01-09 22:15:41,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a636f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:41, skipping insertion in model container [2025-01-09 22:15:41,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:40" (2/3) ... [2025-01-09 22:15:41,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a636f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:41, skipping insertion in model container [2025-01-09 22:15:41,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:41" (3/3) ... [2025-01-09 22:15:41,221 INFO L128 eAbstractionObserver]: Analyzing ICFG test03.c [2025-01-09 22:15:41,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:15:41,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test03.c that has 1 procedures, 19 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-09 22:15:41,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:15:41,281 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;@2d8e4bfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:15:41,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 22:15:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:15:41,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:41,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:15:41,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-01-09 22:15:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 925573, now seen corresponding path program 1 times [2025-01-09 22:15:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085353128] [2025-01-09 22:15:41,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:15:41,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:15:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085353128] [2025-01-09 22:15:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085353128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283409749] [2025-01-09 22:15:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:41,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:41,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:41,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:41,580 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:41,614 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2025-01-09 22:15:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:41,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:15:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:41,624 INFO L225 Difference]: With dead ends: 16 [2025-01-09 22:15:41,624 INFO L226 Difference]: Without dead ends: 14 [2025-01-09 22:15:41,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:41,628 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:41,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-09 22:15:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-09 22:15:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2025-01-09 22:15:41,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 4 [2025-01-09 22:15:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2025-01-09 22:15:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2025-01-09 22:15:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:15:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:41,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:15:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:15:41,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-01-09 22:15:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 925574, now seen corresponding path program 1 times [2025-01-09 22:15:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470030546] [2025-01-09 22:15:41,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:15:41,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:15:41,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470030546] [2025-01-09 22:15:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470030546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:41,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:15:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974343815] [2025-01-09 22:15:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:41,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:15:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:41,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:15:41,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:41,819 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:41,840 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2025-01-09 22:15:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:15:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:15:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:41,841 INFO L225 Difference]: With dead ends: 12 [2025-01-09 22:15:41,841 INFO L226 Difference]: Without dead ends: 12 [2025-01-09 22:15:41,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:15:41,842 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:41,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-01-09 22:15:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-09 22:15:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2025-01-09 22:15:41,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 4 [2025-01-09 22:15:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:41,847 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2025-01-09 22:15:41,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2025-01-09 22:15:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 22:15:41,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:41,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:41,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:15:41,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-01-09 22:15:41,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash 86934605, now seen corresponding path program 1 times [2025-01-09 22:15:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:41,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918877624] [2025-01-09 22:15:41,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:41,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 22:15:41,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 22:15:41,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:41,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:42,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918877624] [2025-01-09 22:15:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918877624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:15:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630235518] [2025-01-09 22:15:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:15:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:42,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:15:42,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:15:42,357 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:42,495 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2025-01-09 22:15:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:15:42,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 22:15:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:42,495 INFO L225 Difference]: With dead ends: 11 [2025-01-09 22:15:42,495 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 22:15:42,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:15:42,496 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:42,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 22:15:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-09 22:15:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 9 transitions. [2025-01-09 22:15:42,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 9 transitions. Word has length 8 [2025-01-09 22:15:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:42,498 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 9 transitions. [2025-01-09 22:15:42,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 9 transitions. [2025-01-09 22:15:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:15:42,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:15:42,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:15:42,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:15:42,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2025-01-09 22:15:42,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:15:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1599996630, now seen corresponding path program 1 times [2025-01-09 22:15:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:15:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519913413] [2025-01-09 22:15:42,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:15:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:15:42,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:15:42,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:15:42,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:15:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:15:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:15:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:15:42,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519913413] [2025-01-09 22:15:42,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519913413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:15:42,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:15:42,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:15:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922585100] [2025-01-09 22:15:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:15:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:15:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:15:42,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:15:42,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:42,642 INFO L87 Difference]: Start difference. First operand 10 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:15:42,664 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2025-01-09 22:15:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:15:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:15:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:15:42,666 INFO L225 Difference]: With dead ends: 7 [2025-01-09 22:15:42,666 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 22:15:42,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:15:42,666 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:15:42,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:15:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 22:15:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 22:15:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 22:15:42,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2025-01-09 22:15:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:15:42,668 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 22:15:42,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:15:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 22:15:42,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 22:15:42,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2025-01-09 22:15:42,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2025-01-09 22:15:42,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2025-01-09 22:15:42,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2025-01-09 22:15:42,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-09 22:15:42,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-09 22:15:42,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:15:42,675 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 22:15:42,677 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:15:42,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:15:42 BoogieIcfgContainer [2025-01-09 22:15:42,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:15:42,681 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:15:42,681 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:15:42,681 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:15:42,682 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:41" (3/4) ... [2025-01-09 22:15:42,683 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 22:15:42,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 22:15:42,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 22:15:42,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 22:15:42,689 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 22:15:42,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:15:42,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:15:42,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:15:42,777 INFO L158 Benchmark]: Toolchain (without parser) took 2133.61ms. Allocated memory was 562.0MB in the beginning and 142.6MB in the end (delta: -419.4MB). Free memory was 529.8MB in the beginning and 111.8MB in the end (delta: 418.0MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2025-01-09 22:15:42,778 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:15:42,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.54ms. Allocated memory was 562.0MB in the beginning and 142.6MB in the end (delta: -419.4MB). Free memory was 529.8MB in the beginning and 100.8MB in the end (delta: 429.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:15:42,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:15:42,779 INFO L158 Benchmark]: Boogie Preprocessor took 41.55ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:15:42,779 INFO L158 Benchmark]: RCFGBuilder took 270.81ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 86.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:15:42,780 INFO L158 Benchmark]: TraceAbstraction took 1466.17ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 46.0MB in the end (delta: 40.1MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2025-01-09 22:15:42,780 INFO L158 Benchmark]: Witness Printer took 94.62ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 111.8MB in the end (delta: -65.7MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2025-01-09 22:15:42,781 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.54ms. Allocated memory was 562.0MB in the beginning and 142.6MB in the end (delta: -419.4MB). Free memory was 529.8MB in the beginning and 100.8MB in the end (delta: 429.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.55ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.81ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 86.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1466.17ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 46.0MB in the end (delta: 40.1MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 94.62ms. Allocated memory is still 142.6MB. Free memory was 46.0MB in the beginning and 111.8MB in the end (delta: -65.7MB). Peak memory consumption was 8.5MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 27 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 22:15:42,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE