./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c -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 fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:48:24,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:48:24,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:48:24,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:48:24,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:48:24,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:48:24,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:48:24,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:48:24,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:48:24,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:48:24,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:48:24,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:48:24,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:48:24,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:48:24,192 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:48:24,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:48:24,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:24,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:24,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:24,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:48:24,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:48:24,194 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 -> fabc9d8a61dd824da0c561a6d62c57fe8eb320f6ad8009599cd12699fa04e01c [2025-01-09 22:48:24,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:48:24,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:48:24,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:48:24,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:48:24,407 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:48:24,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-01-09 22:48:25,522 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acce9bf7b/f1a5e0357b6841dea037df6de598dbcd/FLAG759446fec [2025-01-09 22:48:25,735 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:48:25,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2025-01-09 22:48:25,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acce9bf7b/f1a5e0357b6841dea037df6de598dbcd/FLAG759446fec [2025-01-09 22:48:25,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acce9bf7b/f1a5e0357b6841dea037df6de598dbcd [2025-01-09 22:48:25,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:48:25,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:48:25,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:25,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:48:25,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:48:25,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd207b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25, skipping insertion in model container [2025-01-09 22:48:25,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:48:25,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:25,879 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:48:25,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:48:25,904 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:48:25,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25 WrapperNode [2025-01-09 22:48:25,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:48:25,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:25,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:48:25,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:48:25,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,931 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-01-09 22:48:25,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:48:25,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:48:25,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:48:25,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:48:25,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,950 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 2 writes are split as follows [2]. [2025-01-09 22:48:25,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:48:25,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:48:25,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:48:25,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:48:25,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (1/1) ... [2025-01-09 22:48:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:48:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:25,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:48:26,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:48:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:48:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:48:26,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:48:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:48:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:48:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:48:26,069 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:48:26,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:48:26,171 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 22:48:26,171 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:48:26,176 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:48:26,176 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:48:26,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:26 BoogieIcfgContainer [2025-01-09 22:48:26,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:48:26,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:48:26,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:48:26,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:48:26,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:48:25" (1/3) ... [2025-01-09 22:48:26,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7953209a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:26, skipping insertion in model container [2025-01-09 22:48:26,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:48:25" (2/3) ... [2025-01-09 22:48:26,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7953209a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:48:26, skipping insertion in model container [2025-01-09 22:48:26,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:26" (3/3) ... [2025-01-09 22:48:26,183 INFO L128 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2025-01-09 22:48:26,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:48:26,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NonTermination3-1.c that has 1 procedures, 23 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-01-09 22:48:26,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:48:26,226 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;@2b8bd000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:48:26,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 22:48:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:48:26,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:26,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:48:26,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:26,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:48:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190619106] [2025-01-09 22:48:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:26,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:48:26,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:48:26,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:26,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190619106] [2025-01-09 22:48:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190619106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576100784] [2025-01-09 22:48:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:26,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:26,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:26,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:26,379 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:26,415 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-01-09 22:48:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:48:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:26,420 INFO L225 Difference]: With dead ends: 20 [2025-01-09 22:48:26,420 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 22:48:26,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:26,424 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:26,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 22:48:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 22:48:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) 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-01-09 22:48:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-09 22:48:26,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 4 [2025-01-09 22:48:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:26,443 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-09 22:48:26,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-09 22:48:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:48:26,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:26,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:48:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:48:26,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:48:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881611484] [2025-01-09 22:48:26,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:48:26,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:48:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:26,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:26,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881611484] [2025-01-09 22:48:26,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881611484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:26,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:26,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:48:26,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473439732] [2025-01-09 22:48:26,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:26,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:26,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:26,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:26,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:26,526 INFO L87 Difference]: Start difference. First operand 18 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-01-09 22:48:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:26,545 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-01-09 22:48:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-09 22:48:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:26,547 INFO L225 Difference]: With dead ends: 21 [2025-01-09 22:48:26,548 INFO L226 Difference]: Without dead ends: 21 [2025-01-09 22:48:26,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:26,548 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:26,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-09 22:48:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-01-09 22:48:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-09 22:48:26,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 4 [2025-01-09 22:48:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:26,555 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-09 22:48:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-09 22:48:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:48:26,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:26,555 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 22:48:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:48:26,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1805828105, now seen corresponding path program 1 times [2025-01-09 22:48:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56223292] [2025-01-09 22:48:26,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:26,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:26,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:26,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:26,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56223292] [2025-01-09 22:48:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56223292] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995267459] [2025-01-09 22:48:26,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:26,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:26,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:26,742 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-01-09 22:48:26,744 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-01-09 22:48:26,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:48:26,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:48:26,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:26,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:26,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:48:26,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:26,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:48:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:26,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995267459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:27,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-01-09 22:48:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430850893] [2025-01-09 22:48:27,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:27,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:48:27,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:27,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:48:27,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:48:27,004 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:27,081 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-01-09 22:48:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:48:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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) Word has length 7 [2025-01-09 22:48:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:27,082 INFO L225 Difference]: With dead ends: 27 [2025-01-09 22:48:27,082 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 22:48:27,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:48:27,083 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:27,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 22:48:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 22:48:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-09 22:48:27,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 7 [2025-01-09 22:48:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-09 22:48:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-09 22:48:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:48:27,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:27,086 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:27,093 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-01-09 22:48:27,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:27,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:27,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1103290518, now seen corresponding path program 1 times [2025-01-09 22:48:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037891607] [2025-01-09 22:48:27,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:27,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:48:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:48:27,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:27,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:48:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037891607] [2025-01-09 22:48:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037891607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:48:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613574010] [2025-01-09 22:48:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:48:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:27,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:48:27,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:48:27,462 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:27,508 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-01-09 22:48:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:48:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 22:48:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:27,508 INFO L225 Difference]: With dead ends: 32 [2025-01-09 22:48:27,508 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 22:48:27,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:48:27,510 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:27,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 22:48:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-01-09 22:48:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-01-09 22:48:27,512 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2025-01-09 22:48:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:27,512 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-01-09 22:48:27,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-01-09 22:48:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:48:27,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:27,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:27,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:48:27,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash 594920846, now seen corresponding path program 1 times [2025-01-09 22:48:27,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:27,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683725576] [2025-01-09 22:48:27,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:27,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:48:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:48:27,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:27,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 22:48:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683725576] [2025-01-09 22:48:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683725576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036106820] [2025-01-09 22:48:27,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:27,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:48:27,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:27,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:48:27,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:27,540 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:27,547 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-01-09 22:48:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:48:27,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:48:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:27,548 INFO L225 Difference]: With dead ends: 27 [2025-01-09 22:48:27,548 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 22:48:27,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:48:27,549 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:27,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 22:48:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 22:48:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-09 22:48:27,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2025-01-09 22:48:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:27,551 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-09 22:48:27,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-09 22:48:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:48:27,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:27,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:48:27,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 594922991, now seen corresponding path program 1 times [2025-01-09 22:48:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002414596] [2025-01-09 22:48:27,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:27,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:48:27,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:48:27,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:27,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002414596] [2025-01-09 22:48:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002414596] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:48:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799150004] [2025-01-09 22:48:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:48:27,638 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-01-09 22:48:27,639 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-01-09 22:48:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:48:27,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:48:27,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:27,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:27,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:48:27,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:48:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:27,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:48:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:48:27,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799150004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:48:27,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:48:27,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 22:48:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052928389] [2025-01-09 22:48:27,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:48:27,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:48:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:27,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:48:27,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:48:27,769 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-01-09 22:48:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:27,805 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-01-09 22:48:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:48:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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) Word has length 20 [2025-01-09 22:48:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:27,806 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:48:27,806 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 22:48:27,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:48:27,807 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:27,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 22:48:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 22:48:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-01-09 22:48:27,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 20 [2025-01-09 22:48:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-01-09 22:48:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-01-09 22:48:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-01-09 22:48:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:48:27,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:27,811 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:27,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 22:48:28,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:48:28,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -866163377, now seen corresponding path program 2 times [2025-01-09 22:48:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536960630] [2025-01-09 22:48:28,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:48:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:28,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 22:48:28,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-01-09 22:48:28,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:48:28,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:48:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 22:48:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:48:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536960630] [2025-01-09 22:48:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536960630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:48:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:48:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:48:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601115036] [2025-01-09 22:48:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:48:28,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:48:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:48:28,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:48:28,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:48:28,080 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:48:28,091 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-01-09 22:48:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:48:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 22:48:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:48:28,092 INFO L225 Difference]: With dead ends: 44 [2025-01-09 22:48:28,092 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 22:48:28,092 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-01-09 22:48:28,093 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:48:28,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:48:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 22:48:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 22:48:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2025-01-09 22:48:28,095 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2025-01-09 22:48:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:48:28,095 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2025-01-09 22:48:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:48:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2025-01-09 22:48:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 22:48:28,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:48:28,096 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:48:28,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-01-09 22:48:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:48:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 658198609, now seen corresponding path program 1 times [2025-01-09 22:48:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:48:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199765703] [2025-01-09 22:48:28,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:48:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:48:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:48:28,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:48:28,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:48:28,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 22:48:28,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 22:48:28,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 22:48:28,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:48:28,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 22:48:28,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 22:48:28,171 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 22:48:28,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2025-01-09 22:48:28,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-01-09 22:48:28,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-01-09 22:48:28,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-01-09 22:48:28,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-01-09 22:48:28,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-01-09 22:48:28,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-09 22:48:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:48:28,176 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:48:28,208 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 22:48:28,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:48:28 BoogieIcfgContainer [2025-01-09 22:48:28,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 22:48:28,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 22:48:28,212 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 22:48:28,212 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 22:48:28,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:48:26" (3/4) ... [2025-01-09 22:48:28,214 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 22:48:28,251 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 13. [2025-01-09 22:48:28,291 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 22:48:28,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 22:48:28,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 22:48:28,293 INFO L158 Benchmark]: Toolchain (without parser) took 2538.68ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 76.4MB in the end (delta: 36.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2025-01-09 22:48:28,293 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:48:28,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.98ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:48:28,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:48:28,294 INFO L158 Benchmark]: Boogie Preprocessor took 37.29ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 897.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 22:48:28,295 INFO L158 Benchmark]: RCFGBuilder took 207.08ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 89.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 22:48:28,295 INFO L158 Benchmark]: TraceAbstraction took 2032.08ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.0MB in the end (delta: 5.6MB). Peak memory consumption was 755.2kB. Max. memory is 16.1GB. [2025-01-09 22:48:28,295 INFO L158 Benchmark]: Witness Printer took 80.39ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 76.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 22:48:28,296 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.98ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.5MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.29ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 897.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 207.08ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 89.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2032.08ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.0MB in the end (delta: 5.6MB). Peak memory consumption was 755.2kB. Max. memory is 16.1GB. * Witness Printer took 80.39ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 76.4MB in the end (delta: 6.6MB). 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [a={2:0}, i=0] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [a={2:0}] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 104 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 178 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 189/261 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-09 22:48:28,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)