./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strrchr_short.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/termination-dietlibc/strrchr_short.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 5714449da9967bbd2918d4305e52dc9c1161024d975984886640d613abe881d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:08:53,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:08:53,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 10:08:53,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:08:53,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:08:53,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:08:53,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:08:53,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:08:53,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:08:53,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:08:53,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:08:53,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:08:53,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:08:53,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:08:53,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:08:53,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:08:53,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:08:53,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:08:53,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:08:53,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:08:53,532 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5714449da9967bbd2918d4305e52dc9c1161024d975984886640d613abe881d1 [2025-02-06 10:08:53,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:08:53,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:08:53,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:08:53,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:08:53,711 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:08:53,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strrchr_short.i [2025-02-06 10:08:54,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7f0eda59/538587100306438ab60b2af69bf2617f/FLAG6f01686b7 [2025-02-06 10:08:55,294 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:08:55,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr_short.i [2025-02-06 10:08:55,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7f0eda59/538587100306438ab60b2af69bf2617f/FLAG6f01686b7 [2025-02-06 10:08:55,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7f0eda59/538587100306438ab60b2af69bf2617f [2025-02-06 10:08:55,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:08:55,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:08:55,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:08:55,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:08:55,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:08:55,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55, skipping insertion in model container [2025-02-06 10:08:55,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:08:55,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:08:55,767 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:08:55,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:08:55,803 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:08:55,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55 WrapperNode [2025-02-06 10:08:55,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:08:55,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:08:55,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:08:55,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:08:55,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,825 INFO L138 Inliner]: procedures = 113, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-02-06 10:08:55,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:08:55,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:08:55,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:08:55,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:08:55,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,839 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-02-06 10:08:55,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:08:55,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:08:55,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:08:55,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:08:55,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (1/1) ... [2025-02-06 10:08:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:08:55,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:55,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:08:55,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:08:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:08:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:08:55,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:08:55,936 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:08:55,938 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:08:56,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;call ULTIMATE.dealloc(main_#t~malloc6#1.base, main_#t~malloc6#1.offset);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; [2025-02-06 10:08:56,044 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-06 10:08:56,044 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:08:56,051 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:08:56,051 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:08:56,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:08:56 BoogieIcfgContainer [2025-02-06 10:08:56,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:08:56,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:08:56,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:08:56,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:08:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:08:55" (1/3) ... [2025-02-06 10:08:56,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b805f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:08:56, skipping insertion in model container [2025-02-06 10:08:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:55" (2/3) ... [2025-02-06 10:08:56,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7b805f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:08:56, skipping insertion in model container [2025-02-06 10:08:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:08:56" (3/3) ... [2025-02-06 10:08:56,059 INFO L128 eAbstractionObserver]: Analyzing ICFG strrchr_short.i [2025-02-06 10:08:56,070 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:08:56,071 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strrchr_short.i that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-02-06 10:08:56,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:08:56,111 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;@54ff8afa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:08:56,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 10:08:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 20 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-02-06 10:08:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:08:56,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:08:56,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1876710, now seen corresponding path program 1 times [2025-02-06 10:08:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124823216] [2025-02-06 10:08:56,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:08:56,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:08:56,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124823216] [2025-02-06 10:08:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124823216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:08:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732687927] [2025-02-06 10:08:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:08:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:08:56,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:08:56,260 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 20 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) 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-02-06 10:08:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,295 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-02-06 10:08:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:08:56,297 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-02-06 10:08:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,301 INFO L225 Difference]: With dead ends: 22 [2025-02-06 10:08:56,301 INFO L226 Difference]: Without dead ends: 19 [2025-02-06 10:08:56,302 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-02-06 10:08:56,306 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-06 10:08:56,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 10:08:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 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-02-06 10:08:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-06 10:08:56,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2025-02-06 10:08:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,332 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-06 10:08:56,333 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-02-06 10:08:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-06 10:08:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:08:56,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:08:56,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:08:56,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1876794, now seen corresponding path program 1 times [2025-02-06 10:08:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101855813] [2025-02-06 10:08:56,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:08:56,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:08:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:56,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101855813] [2025-02-06 10:08:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101855813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:08:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168748183] [2025-02-06 10:08:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:08:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:08:56,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:08:56,427 INFO L87 Difference]: Start difference. First operand 19 states and 20 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-02-06 10:08:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,453 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-02-06 10:08:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:08:56,453 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-02-06 10:08:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,454 INFO L225 Difference]: With dead ends: 18 [2025-02-06 10:08:56,454 INFO L226 Difference]: Without dead ends: 18 [2025-02-06 10:08:56,454 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-02-06 10:08:56,455 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-06 10:08:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-06 10:08:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 17 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-02-06 10:08:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-06 10:08:56,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 4 [2025-02-06 10:08:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,460 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-06 10:08:56,461 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-02-06 10:08:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-06 10:08:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:08:56,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:08:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:08:56,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1876795, now seen corresponding path program 1 times [2025-02-06 10:08:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076361848] [2025-02-06 10:08:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:08:56,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:08:56,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076361848] [2025-02-06 10:08:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076361848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590877276] [2025-02-06 10:08:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:56,662 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 10:08:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,685 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-06 10:08:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:56,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 10:08:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,686 INFO L225 Difference]: With dead ends: 17 [2025-02-06 10:08:56,686 INFO L226 Difference]: Without dead ends: 17 [2025-02-06 10:08:56,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:56,687 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-06 10:08:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-06 10:08:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 16 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-02-06 10:08:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-02-06 10:08:56,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 4 [2025-02-06 10:08:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,689 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-02-06 10:08:56,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-02-06 10:08:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-02-06 10:08:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:08:56,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:08:56,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 76986234, now seen corresponding path program 1 times [2025-02-06 10:08:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109173052] [2025-02-06 10:08:56,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:08:56,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:08:56,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109173052] [2025-02-06 10:08:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109173052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642484349] [2025-02-06 10:08:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:56,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:56,741 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-02-06 10:08:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,765 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-02-06 10:08:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-02-06 10:08:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,766 INFO L225 Difference]: With dead ends: 15 [2025-02-06 10:08:56,766 INFO L226 Difference]: Without dead ends: 15 [2025-02-06 10:08:56,766 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-02-06 10:08:56,767 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-06 10:08:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-06 10:08:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 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-02-06 10:08:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-06 10:08:56,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2025-02-06 10:08:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,769 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-06 10:08:56,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-02-06 10:08:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-02-06 10:08:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:08:56,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:08:56,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash 76986235, now seen corresponding path program 1 times [2025-02-06 10:08:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-02-06 10:08:56,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:08:56,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:08:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595590794] [2025-02-06 10:08:56,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595590794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:56,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339311692] [2025-02-06 10:08:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:56,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:56,920 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-02-06 10:08:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,946 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-02-06 10:08:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2025-02-06 10:08:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,947 INFO L225 Difference]: With dead ends: 21 [2025-02-06 10:08:56,947 INFO L226 Difference]: Without dead ends: 21 [2025-02-06 10:08:56,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:56,948 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-06 10:08:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-02-06 10:08:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 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-02-06 10:08:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-02-06 10:08:56,950 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2025-02-06 10:08:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,950 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-02-06 10:08:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-02-06 10:08:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-02-06 10:08:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:08:56,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:56,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:08:56,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2137332465, now seen corresponding path program 1 times [2025-02-06 10:08:56,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062190321] [2025-02-06 10:08:56,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:08:56,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:08:56,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:56,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062190321] [2025-02-06 10:08:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062190321] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:57,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794287058] [2025-02-06 10:08:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:57,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:57,029 INFO L87 Difference]: Start difference. First operand 19 states and 21 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-02-06 10:08:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:57,040 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-02-06 10:08:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:57,041 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-02-06 10:08:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:57,041 INFO L225 Difference]: With dead ends: 18 [2025-02-06 10:08:57,041 INFO L226 Difference]: Without dead ends: 16 [2025-02-06 10:08:57,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:57,042 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:57,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-06 10:08:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-06 10:08:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 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-02-06 10:08:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-02-06 10:08:57,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-02-06 10:08:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:57,044 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-02-06 10:08:57,044 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-02-06 10:08:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-02-06 10:08:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:08:57,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:57,045 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:08:57,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2137334901, now seen corresponding path program 1 times [2025-02-06 10:08:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280391116] [2025-02-06 10:08:57,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:57,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:08:57,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:08:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:57,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280391116] [2025-02-06 10:08:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280391116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825642692] [2025-02-06 10:08:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:57,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:57,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:08:57,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:08:57,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:08:57,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:57,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:57,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:08:57,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:57,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:57,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 10:08:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:57,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:57,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:08:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:08:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 10:08:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825642692] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:57,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:57,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-02-06 10:08:57,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111862253] [2025-02-06 10:08:57,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:57,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 10:08:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:57,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 10:08:57,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:08:57,826 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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-02-06 10:08:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:58,169 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-02-06 10:08:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:08:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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-02-06 10:08:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:58,170 INFO L225 Difference]: With dead ends: 21 [2025-02-06 10:08:58,170 INFO L226 Difference]: Without dead ends: 21 [2025-02-06 10:08:58,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:08:58,170 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:58,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:08:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-06 10:08:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-02-06 10:08:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-02-06 10:08:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-06 10:08:58,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2025-02-06 10:08:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-06 10:08:58,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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-02-06 10:08:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-02-06 10:08:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:08:58,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:58,173 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:58,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:08:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:58,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:08:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1957313605, now seen corresponding path program 2 times [2025-02-06 10:08:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-06 10:08:58,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:58,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 10:08:58,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:08:58,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:58,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:58,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669535316] [2025-02-06 10:08:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669535316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:58,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223204158] [2025-02-06 10:08:58,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:58,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:58,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:58,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:58,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:08:58,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 10:08:58,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:08:58,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:58,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:58,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:08:58,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:58,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:59,341 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-02-06 10:08:59,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2025-02-06 10:08:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:59,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:59,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:08:59,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 10:08:59,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-06 10:08:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223204158] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:59,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-06 10:08:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095742297] [2025-02-06 10:08:59,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:08:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:59,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:08:59,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=400, Unknown=1, NotChecked=0, Total=462 [2025-02-06 10:08:59,630 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-02-06 10:09:05,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:09:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:06,982 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-02-06 10:09:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:09:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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 17 [2025-02-06 10:09:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:06,984 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:09:06,984 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:09:06,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=842, Unknown=3, NotChecked=0, Total=992 [2025-02-06 10:09:06,984 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:06,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 117 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 8 Unknown, 0 Unchecked, 6.5s Time] [2025-02-06 10:09:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:09:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2025-02-06 10:09:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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-02-06 10:09:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-06 10:09:06,986 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2025-02-06 10:09:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-06 10:09:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 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-02-06 10:09:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-02-06 10:09:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:09:06,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:06,990 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:06,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:09:07,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:07,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-02-06 10:09:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1113412619, now seen corresponding path program 3 times [2025-02-06 10:09:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988498111] [2025-02-06 10:09:07,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:09:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:07,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 6 equivalence classes. [2025-02-06 10:09:07,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:09:07,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:09:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:09:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988498111] [2025-02-06 10:09:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988498111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642060028] [2025-02-06 10:09:07,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:09:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:07,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:09:07,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 6 equivalence classes. [2025-02-06 10:09:07,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:09:07,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:09:07,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:07,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:09:07,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:07,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:09:08,496 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-02-06 10:09:08,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2025-02-06 10:09:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 10:09:08,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:09,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2025-02-06 10:09:09,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:09:09,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2025-02-06 10:09:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:09:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:09:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642060028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:10,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 32 [2025-02-06 10:09:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583805180] [2025-02-06 10:09:10,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:09:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:10,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:09:10,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:09:10,019 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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-02-06 10:09:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:10,510 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-02-06 10:09:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:09:10,511 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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 32 [2025-02-06 10:09:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:10,511 INFO L225 Difference]: With dead ends: 32 [2025-02-06 10:09:10,511 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:09:10,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=388, Invalid=1592, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 10:09:10,513 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:10,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:09:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:09:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:09:10,514 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-02-06 10:09:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:09:10,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2025-02-06 10:09:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:09:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.4375) internal successors, (78), 33 states have internal predecessors, (78), 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-02-06 10:09:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:09:10,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:09:10,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-02-06 10:09:10,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-02-06 10:09:10,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:09:10,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:10,720 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:10,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:09:10,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:09:10 BoogieIcfgContainer [2025-02-06 10:09:10,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:09:10,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:09:10,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:09:10,725 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:09:10,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:08:56" (3/4) ... [2025-02-06 10:09:10,727 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:09:10,734 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 10:09:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 10:09:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 10:09:10,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:09:10,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:09:10,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:09:10,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:09:10,806 INFO L158 Benchmark]: Toolchain (without parser) took 15251.73ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 131.2MB in the beginning and 207.1MB in the end (delta: -75.9MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2025-02-06 10:09:10,806 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:09:10,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.27ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 114.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:09:10,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.82ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:09:10,807 INFO L158 Benchmark]: Boogie Preprocessor took 18.66ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:09:10,807 INFO L158 Benchmark]: IcfgBuilder took 206.64ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 99.2MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:09:10,807 INFO L158 Benchmark]: TraceAbstraction took 14671.29ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 98.6MB in the beginning and 212.3MB in the end (delta: -113.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:09:10,807 INFO L158 Benchmark]: Witness Printer took 80.79ms. Allocated memory is still 260.0MB. Free memory was 212.3MB in the beginning and 207.1MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:09:10,808 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 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.27ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 114.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.82ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.66ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 112.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 206.64ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 99.2MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14671.29ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 98.6MB in the beginning and 212.3MB in the end (delta: -113.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 80.79ms. Allocated memory is still 260.0MB. Free memory was 212.3MB in the beginning and 207.1MB in the end (delta: 5.2MB). 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: 515]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 570 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 105 mSDtfsCounter, 570 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, InterpolantAutomatonStates: 59, 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, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 206 ConstructedInterpolants, 62 QuantifiedInterpolants, 4235 SizeOfPredicates, 15 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 46/213 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:09:10,825 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