./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.04-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/termination-memory-alloca/a.04-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9eb9364aba11d587c1c0c7aaba55178ecb567e9587bda48270a0861bd272aa34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:41:54,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:41:55,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-08 22:41:55,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:41:55,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:41:55,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:41:55,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:41:55,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:41:55,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:41:55,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:41:55,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:41:55,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:41:55,049 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:41:55,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:41:55,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:41:55,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:41:55,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:41:55,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:41:55,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:41:55,052 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9eb9364aba11d587c1c0c7aaba55178ecb567e9587bda48270a0861bd272aa34 [2025-03-08 22:41:55,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:41:55,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:41:55,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:41:55,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:41:55,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:41:55,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.04-alloca.i [2025-03-08 22:41:56,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424bf642/1f00f0cbc4b84af082da87a94035efb1/FLAGa1ca90a23 [2025-03-08 22:41:56,679 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:41:56,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.04-alloca.i [2025-03-08 22:41:56,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424bf642/1f00f0cbc4b84af082da87a94035efb1/FLAGa1ca90a23 [2025-03-08 22:41:56,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424bf642/1f00f0cbc4b84af082da87a94035efb1 [2025-03-08 22:41:56,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:41:56,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:41:56,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:41:56,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:41:56,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:41:56,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:56,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1d7249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56, skipping insertion in model container [2025-03-08 22:41:56,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:56,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:41:56,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:41:56,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:41:56,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:41:56,985 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:41:56,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56 WrapperNode [2025-03-08 22:41:56,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:41:56,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:41:56,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:41:56,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:41:56,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:56,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,009 INFO L138 Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-08 22:41:57,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:41:57,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:41:57,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:41:57,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:41:57,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,026 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [4, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 4 writes are split as follows [2, 1, 1]. [2025-03-08 22:41:57,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:41:57,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:41:57,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:41:57,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:41:57,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (1/1) ... [2025-03-08 22:41:57,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:41:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:41:57,057 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) [2025-03-08 22:41:57,062 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 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:41:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:41:57,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:41:57,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:41:57,154 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:41:57,300 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc test_fun_#t~mem8#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-08 22:41:57,301 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;havoc main_#t~ret11#1; [2025-03-08 22:41:57,311 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 22:41:57,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:41:57,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:41:57,319 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:41:57,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:41:57 BoogieIcfgContainer [2025-03-08 22:41:57,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:41:57,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:41:57,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:41:57,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:41:57,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:41:56" (1/3) ... [2025-03-08 22:41:57,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622429c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:41:57, skipping insertion in model container [2025-03-08 22:41:57,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:41:56" (2/3) ... [2025-03-08 22:41:57,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622429c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:41:57, skipping insertion in model container [2025-03-08 22:41:57,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:41:57" (3/3) ... [2025-03-08 22:41:57,327 INFO L128 eAbstractionObserver]: Analyzing ICFG a.04-alloca.i [2025-03-08 22:41:57,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:41:57,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG a.04-alloca.i that has 1 procedures, 34 locations, 1 initial locations, 1 loop locations, and 17 error locations. [2025-03-08 22:41:57,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:41:57,370 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;@17ec80ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:41:57,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-08 22:41:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 16 states have (on average 2.1875) internal successors, (35), 33 states have internal predecessors, (35), 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-03-08 22:41:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:41:57,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:57,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:41:57,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:57,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash 66498, now seen corresponding path program 1 times [2025-03-08 22:41:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196317143] [2025-03-08 22:41:57,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:57,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:41:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:41:57,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:57,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:57,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196317143] [2025-03-08 22:41:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196317143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110635263] [2025-03-08 22:41:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:57,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:57,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:57,696 INFO L87 Difference]: Start difference. First operand has 34 states, 16 states have (on average 2.1875) internal successors, (35), 33 states have internal predecessors, (35), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:41:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:57,751 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2025-03-08 22:41:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 22:41:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:57,757 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:41:57,757 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 22:41:57,758 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-03-08 22:41:57,760 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:57,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 22:41:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 22:41:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 2.0) internal successors, (30), 29 states have internal predecessors, (30), 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-03-08 22:41:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-08 22:41:57,786 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 3 [2025-03-08 22:41:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:57,786 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-08 22:41:57,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:41:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-08 22:41:57,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 22:41:57,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:57,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 22:41:57,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:41:57,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 66499, now seen corresponding path program 1 times [2025-03-08 22:41:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634652252] [2025-03-08 22:41:57,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:57,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 22:41:57,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 22:41:57,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634652252] [2025-03-08 22:41:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634652252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784353849] [2025-03-08 22:41:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:57,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:57,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:57,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:57,957 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:41:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:57,988 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2025-03-08 22:41:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 22:41:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:57,989 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:41:57,989 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 22:41:57,990 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-03-08 22:41:57,991 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:57,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 22:41:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 22:41:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 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-03-08 22:41:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-08 22:41:57,997 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 3 [2025-03-08 22:41:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:57,998 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-08 22:41:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-03-08 22:41:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-08 22:41:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:41:57,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:57,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:41:57,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:41:57,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:57,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2061439, now seen corresponding path program 1 times [2025-03-08 22:41:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413673604] [2025-03-08 22:41:58,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:58,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:58,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:41:58,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:41:58,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:58,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:58,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:58,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413673604] [2025-03-08 22:41:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413673604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:58,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:58,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501740913] [2025-03-08 22:41:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:58,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:58,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:58,104 INFO L87 Difference]: Start difference. First operand 28 states and 28 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-03-08 22:41:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:58,139 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-03-08 22:41:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:58,139 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-03-08 22:41:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:58,140 INFO L225 Difference]: With dead ends: 24 [2025-03-08 22:41:58,140 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 22:41:58,140 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-03-08 22:41:58,141 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:58,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 22:41:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 22:41:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 states have internal predecessors, (24), 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-03-08 22:41:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-08 22:41:58,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 4 [2025-03-08 22:41:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-08 22:41:58,145 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-03-08 22:41:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-08 22:41:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-08 22:41:58,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:58,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-08 22:41:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:41:58,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:58,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2061438, now seen corresponding path program 1 times [2025-03-08 22:41:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:58,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925246412] [2025-03-08 22:41:58,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:58,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 22:41:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 22:41:58,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:58,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:58,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925246412] [2025-03-08 22:41:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925246412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917757466] [2025-03-08 22:41:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:58,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:58,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:58,220 INFO L87 Difference]: Start difference. First operand 24 states and 24 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-03-08 22:41:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:58,247 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-08 22:41:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:58,248 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-03-08 22:41:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:58,248 INFO L225 Difference]: With dead ends: 20 [2025-03-08 22:41:58,249 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 22:41:58,249 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-03-08 22:41:58,249 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:58,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 22:41:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 22:41:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 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-03-08 22:41:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-08 22:41:58,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 4 [2025-03-08 22:41:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:58,252 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-08 22:41:58,252 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-03-08 22:41:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-08 22:41:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:41:58,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:58,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:41:58,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:41:58,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash 63904575, now seen corresponding path program 1 times [2025-03-08 22:41:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575953493] [2025-03-08 22:41:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:58,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:41:58,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:41:58,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575953493] [2025-03-08 22:41:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575953493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:58,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:58,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:58,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524077137] [2025-03-08 22:41:58,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:58,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:58,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:58,309 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:58,330 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-08 22:41:58,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:58,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:41:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:58,330 INFO L225 Difference]: With dead ends: 18 [2025-03-08 22:41:58,330 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 22:41:58,331 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-03-08 22:41:58,331 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:58,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 22:41:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 22:41:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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-03-08 22:41:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-08 22:41:58,332 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2025-03-08 22:41:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:58,333 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-08 22:41:58,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-08 22:41:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:41:58,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:58,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:41:58,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:41:58,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 63904576, now seen corresponding path program 1 times [2025-03-08 22:41:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502171837] [2025-03-08 22:41:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:58,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:41:58,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:41:58,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:58,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502171837] [2025-03-08 22:41:58,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502171837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:58,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:58,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:41:58,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061018664] [2025-03-08 22:41:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:58,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:41:58,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:58,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:41:58,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:41:58,386 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:58,404 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-03-08 22:41:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:41:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:41:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:58,405 INFO L225 Difference]: With dead ends: 16 [2025-03-08 22:41:58,405 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 22:41:58,405 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-03-08 22:41:58,406 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:58,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 22:41:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-08 22:41:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-03-08 22:41:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-08 22:41:58,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 5 [2025-03-08 22:41:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-08 22:41:58,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:41:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-08 22:41:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:41:58,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:41:58,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:41:58,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2025-03-08 22:41:58,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:41:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1317724524, now seen corresponding path program 1 times [2025-03-08 22:41:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:41:58,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106165792] [2025-03-08 22:41:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:41:58,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:41:58,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:41:58,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:41:58,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:41:58,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:41:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:41:58,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:41:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106165792] [2025-03-08 22:41:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106165792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:41:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:41:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:41:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919067319] [2025-03-08 22:41:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:41:58,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:41:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:41:58,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:41:58,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:41:58,599 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-08 22:41:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:41:58,623 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 22:41:58,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:41:58,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-08 22:41:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:41:58,623 INFO L225 Difference]: With dead ends: 15 [2025-03-08 22:41:58,624 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:41:58,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:41:58,624 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:41:58,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:41:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:41:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:41:58,625 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-03-08 22:41:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:41:58,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2025-03-08 22:41:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:41:58,625 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:41:58,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-08 22:41:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:41:58,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:41:58,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (16 of 17 remaining) [2025-03-08 22:41:58,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2025-03-08 22:41:58,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2025-03-08 22:41:58,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2025-03-08 22:41:58,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2025-03-08 22:41:58,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2025-03-08 22:41:58,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2025-03-08 22:41:58,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2025-03-08 22:41:58,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 17 remaining) [2025-03-08 22:41:58,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:41:58,634 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:41:58,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:41:58,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:41:58 BoogieIcfgContainer [2025-03-08 22:41:58,639 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:41:58,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:41:58,640 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:41:58,640 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:41:58,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:41:57" (3/4) ... [2025-03-08 22:41:58,642 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:41:58,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-08 22:41:58,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:41:58,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:41:58,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:41:58,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:41:58,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:41:58,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:41:58,705 INFO L158 Benchmark]: Toolchain (without parser) took 1997.74ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 70.1MB in the end (delta: 38.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2025-03-08 22:41:58,705 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:41:58,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.43ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:41:58,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.01ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:41:58,706 INFO L158 Benchmark]: Boogie Preprocessor took 22.17ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:41:58,706 INFO L158 Benchmark]: IcfgBuilder took 286.58ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 75.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:41:58,707 INFO L158 Benchmark]: TraceAbstraction took 1318.15ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 76.2MB in the end (delta: -1.6MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2025-03-08 22:41:58,707 INFO L158 Benchmark]: Witness Printer took 63.35ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 70.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:41:58,708 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.43ms. Allocated memory is still 142.6MB. Free memory was 109.0MB in the beginning and 92.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.01ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.17ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.58ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 75.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1318.15ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 76.2MB in the end (delta: -1.6MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 63.35ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 70.1MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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: -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: -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: -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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 35 edges, 17 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 70 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:41:58,725 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 Result: TRUE