./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:05:19,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:05:19,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:05:19,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:05:19,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:05:19,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:05:19,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:05:19,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:05:19,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:05:19,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:05:19,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:05:19,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:05:19,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:05:19,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:05:19,504 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:05:19,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:05:19,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:05:19,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:05:19,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:05:19,506 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:05:19,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:05:19,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:05:19,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:05:19,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:05:19,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:05:19,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:05:19,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:05:19,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:05:19,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:05:19,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:05:19,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:05:19,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:05:19,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2025-02-06 10:05:19,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:05:19,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:05:19,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:05:19,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:05:19,807 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:05:19,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-02-06 10:05:21,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff19745/dae65cf89ef94437ad025a809fecb3d3/FLAGd07fa6af8 [2025-02-06 10:05:21,494 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:05:21,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2025-02-06 10:05:21,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff19745/dae65cf89ef94437ad025a809fecb3d3/FLAGd07fa6af8 [2025-02-06 10:05:21,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89ff19745/dae65cf89ef94437ad025a809fecb3d3 [2025-02-06 10:05:21,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:05:21,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:05:21,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:21,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:05:21,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:05:21,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e52c4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21, skipping insertion in model container [2025-02-06 10:05:21,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:05:21,825 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:21,827 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:21,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:21,840 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:05:21,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:21,916 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:05:21,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21 WrapperNode [2025-02-06 10:05:21,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:21,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:21,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:05:21,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:05:21,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,959 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2025-02-06 10:05:21,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:21,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:05:21,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:05:21,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:05:21,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,982 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 10:05:21,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:21,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:05:21,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:05:21,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:05:21,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:05:21,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (1/1) ... [2025-02-06 10:05:22,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:05:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:22,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:05:22,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:05:22,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:05:22,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:05:22,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:05:22,159 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:05:22,160 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:05:22,343 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L538: call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-06 10:05:22,361 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-02-06 10:05:22,362 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:05:22,370 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:05:22,371 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:05:22,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:22 BoogieIcfgContainer [2025-02-06 10:05:22,371 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:05:22,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:05:22,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:05:22,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:05:22,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:05:21" (1/3) ... [2025-02-06 10:05:22,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33920832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:22, skipping insertion in model container [2025-02-06 10:05:22,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:21" (2/3) ... [2025-02-06 10:05:22,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33920832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:22, skipping insertion in model container [2025-02-06 10:05:22,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:22" (3/3) ... [2025-02-06 10:05:22,380 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2025-02-06 10:05:22,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:05:22,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrpbrk-alloca-2.i that has 1 procedures, 52 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-06 10:05:22,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:05:22,440 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;@173eaa22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:05:22,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 10:05:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:22,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:22,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:22,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:22,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 565758687, now seen corresponding path program 1 times [2025-02-06 10:05:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786357885] [2025-02-06 10:05:22,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:22,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:22,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:22,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:22,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786357885] [2025-02-06 10:05:22,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786357885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:22,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:22,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:22,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242120922] [2025-02-06 10:05:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:22,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:22,758 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 states have internal predecessors, (61), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:22,808 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-02-06 10:05:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:22,816 INFO L225 Difference]: With dead ends: 62 [2025-02-06 10:05:22,816 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:05:22,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:22,822 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 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-02-06 10:05:22,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:05:22,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-02-06 10:05:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-06 10:05:22,851 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2025-02-06 10:05:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:22,852 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-06 10:05:22,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-06 10:05:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:22,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:22,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:05:22,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 566682208, now seen corresponding path program 1 times [2025-02-06 10:05:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:22,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865774978] [2025-02-06 10:05:22,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:22,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:22,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:22,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:22,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:22,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865774978] [2025-02-06 10:05:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865774978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:23,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:05:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112244371] [2025-02-06 10:05:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:23,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:23,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:23,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:23,049 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:23,114 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-02-06 10:05:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:23,115 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:05:23,116 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:05:23,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:23,117 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:23,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:05:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:05:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-06 10:05:23,123 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2025-02-06 10:05:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:23,123 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-06 10:05:23,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-06 10:05:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:23,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:23,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:05:23,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:23,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash 566682209, now seen corresponding path program 1 times [2025-02-06 10:05:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:23,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19489211] [2025-02-06 10:05:23,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:23,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:23,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:23,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19489211] [2025-02-06 10:05:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19489211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444030007] [2025-02-06 10:05:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:23,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:23,452 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:23,554 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-02-06 10:05:23,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:05:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:23,556 INFO L225 Difference]: With dead ends: 54 [2025-02-06 10:05:23,558 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 10:05:23,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:23,559 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:23,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 10:05:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-02-06 10:05:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-02-06 10:05:23,568 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 7 [2025-02-06 10:05:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:23,568 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-02-06 10:05:23,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-02-06 10:05:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:23,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:23,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:23,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:05:23,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:23,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash 358645079, now seen corresponding path program 1 times [2025-02-06 10:05:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963016023] [2025-02-06 10:05:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:23,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:23,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963016023] [2025-02-06 10:05:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963016023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328431994] [2025-02-06 10:05:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:23,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:23,725 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:23,750 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-02-06 10:05:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:23,753 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:23,753 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:23,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:23,754 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:23,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-02-06 10:05:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.725) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-02-06 10:05:23,762 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 8 [2025-02-06 10:05:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:23,762 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-02-06 10:05:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-02-06 10:05:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:23,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:05:23,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 358645238, now seen corresponding path program 1 times [2025-02-06 10:05:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117594004] [2025-02-06 10:05:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:23,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:23,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:23,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:23,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117594004] [2025-02-06 10:05:23,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117594004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133612392] [2025-02-06 10:05:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:23,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:23,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:23,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:23,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:23,814 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:23,851 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2025-02-06 10:05:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:23,853 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:05:23,853 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:05:23,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:23,854 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:23,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 141 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:05:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-02-06 10:05:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-06 10:05:23,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 8 [2025-02-06 10:05:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:23,862 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-06 10:05:23,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-06 10:05:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:23,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:23,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:23,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:05:23,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 359568759, now seen corresponding path program 1 times [2025-02-06 10:05:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:23,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108082924] [2025-02-06 10:05:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:23,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:23,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:23,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:23,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108082924] [2025-02-06 10:05:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108082924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448903247] [2025-02-06 10:05:24,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:24,026 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:24,115 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-02-06 10:05:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:24,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:24,116 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:05:24,117 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:05:24,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:24,118 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:24,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:05:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-06 10:05:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.58) internal successors, (79), 64 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-06 10:05:24,125 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 8 [2025-02-06 10:05:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:24,125 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-06 10:05:24,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-06 10:05:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:24,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:24,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:24,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:05:24,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:24,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash 359568760, now seen corresponding path program 1 times [2025-02-06 10:05:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032590297] [2025-02-06 10:05:24,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:24,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:24,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:24,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:24,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032590297] [2025-02-06 10:05:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032590297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525027723] [2025-02-06 10:05:24,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:24,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:24,277 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:24,371 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-02-06 10:05:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:05:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:24,372 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:24,372 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:24,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:24,373 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:24,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 126 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-02-06 10:05:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-02-06 10:05:24,381 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-02-06 10:05:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-02-06 10:05:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-02-06 10:05:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:24,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:24,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:05:24,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:24,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 387274230, now seen corresponding path program 1 times [2025-02-06 10:05:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281937454] [2025-02-06 10:05:24,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:24,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:24,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:24,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281937454] [2025-02-06 10:05:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281937454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118974888] [2025-02-06 10:05:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:24,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:24,542 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:24,577 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2025-02-06 10:05:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:24,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:24,579 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:05:24,579 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:05:24,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:24,579 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:24,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:05:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-02-06 10:05:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-02-06 10:05:24,588 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-02-06 10:05:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:24,588 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-02-06 10:05:24,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-02-06 10:05:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:05:24,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:24,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:05:24,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1766904454, now seen corresponding path program 1 times [2025-02-06 10:05:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836668251] [2025-02-06 10:05:24,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:24,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:05:24,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:05:24,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:24,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836668251] [2025-02-06 10:05:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836668251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473850452] [2025-02-06 10:05:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:24,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:24,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:24,718 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02-06 10:05:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:24,762 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-06 10:05:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:05:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:24,763 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:05:24,763 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:05:24,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:24,764 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:24,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:05:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-06 10:05:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 71 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-02-06 10:05:24,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 9 [2025-02-06 10:05:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:24,768 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-02-06 10:05:24,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-02-06 10:05:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-02-06 10:05:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:05:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:24,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:05:24,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1738275303, now seen corresponding path program 1 times [2025-02-06 10:05:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424646741] [2025-02-06 10:05:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:24,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:05:24,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:05:24,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:24,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424646741] [2025-02-06 10:05:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424646741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:24,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505741281] [2025-02-06 10:05:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:24,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:24,859 INFO L87 Difference]: Start difference. First operand 72 states and 89 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-02-06 10:05:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:24,882 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-02-06 10:05:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:24,883 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 9 [2025-02-06 10:05:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:24,883 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:24,883 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:24,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:24,884 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:24,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-02-06 10:05:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 67 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-02-06 10:05:24,889 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 9 [2025-02-06 10:05:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:24,890 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-02-06 10:05:24,890 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-02-06 10:05:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-02-06 10:05:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:05:24,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:24,890 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:05:24,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754118, now seen corresponding path program 1 times [2025-02-06 10:05:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:24,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531685440] [2025-02-06 10:05:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:24,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:24,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:24,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:24,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:25,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531685440] [2025-02-06 10:05:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531685440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929742203] [2025-02-06 10:05:25,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:25,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:25,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:25,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:25,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:05:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:25,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:25,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:25,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:25,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:05:25,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:25,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:25,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:05:25,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:05:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:25,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:25,568 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929742203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:25,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-02-06 10:05:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19603137] [2025-02-06 10:05:25,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:25,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:05:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:25,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:05:25,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:05:25,586 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:25,780 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-02-06 10:05:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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 10 [2025-02-06 10:05:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:25,781 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:25,781 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:25,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:05:25,782 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:25,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 245 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-06 10:05:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-02-06 10:05:25,786 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 10 [2025-02-06 10:05:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:25,786 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-02-06 10:05:25,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-02-06 10:05:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:25,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:25,791 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:25,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:05:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 10:05:25,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 264485117, now seen corresponding path program 1 times [2025-02-06 10:05:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443084962] [2025-02-06 10:05:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:25,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:26,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:26,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443084962] [2025-02-06 10:05:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443084962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082922394] [2025-02-06 10:05:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:26,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:26,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:26,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:26,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:05:26,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:26,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:26,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:26,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:05:26,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:26,328 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 7 [2025-02-06 10:05:26,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:05:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:26,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082922394] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:26,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-06 10:05:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536150702] [2025-02-06 10:05:26,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:26,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:05:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:26,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:05:26,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:05:26,753 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:26,990 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-02-06 10:05:26,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:26,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:26,991 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:05:26,991 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:05:26,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:05:26,992 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:26,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 259 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:05:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2025-02-06 10:05:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.5) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-02-06 10:05:26,995 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 11 [2025-02-06 10:05:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:26,995 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-02-06 10:05:26,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-02-06 10:05:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:26,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:26,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:27,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:05:27,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:27,197 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:27,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1155257533, now seen corresponding path program 1 times [2025-02-06 10:05:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:27,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13528666] [2025-02-06 10:05:27,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:27,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:27,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:27,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13528666] [2025-02-06 10:05:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13528666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444309047] [2025-02-06 10:05:27,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:27,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:27,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:27,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:27,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:05:27,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:27,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:05:27,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:27,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:27,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-06 10:05:27,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:05:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:27,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:27,661 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444309047] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:05:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2025-02-06 10:05:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23676226] [2025-02-06 10:05:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:27,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:27,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:05:27,687 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-02-06 10:05:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:27,762 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-06 10:05:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:27,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 11 [2025-02-06 10:05:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:27,763 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:27,763 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:27,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:05:27,764 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-02-06 10:05:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-06 10:05:27,767 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-02-06 10:05:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:27,767 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-06 10:05:27,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-02-06 10:05:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-06 10:05:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:05:27,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:27,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:05:27,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:27,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:27,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1268574706, now seen corresponding path program 1 times [2025-02-06 10:05:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755692380] [2025-02-06 10:05:27,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:27,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:05:27,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:05:27,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:27,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755692380] [2025-02-06 10:05:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755692380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107788481] [2025-02-06 10:05:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:28,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:28,029 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,073 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-06 10:05:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:05:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,074 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:05:28,074 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:05:28,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:28,075 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:05:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-02-06 10:05:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-02-06 10:05:28,078 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 12 [2025-02-06 10:05:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,078 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-02-06 10:05:28,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-02-06 10:05:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:05:28,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:05:28,080 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1268574707, now seen corresponding path program 1 times [2025-02-06 10:05:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520812066] [2025-02-06 10:05:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:05:28,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:05:28,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520812066] [2025-02-06 10:05:28,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520812066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945286623] [2025-02-06 10:05:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:28,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:28,191 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,274 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2025-02-06 10:05:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:05:28,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:05:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,275 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:05:28,275 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:05:28,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:28,277 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 36 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 129 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:05:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2025-02-06 10:05:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-06 10:05:28,280 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-02-06 10:05:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,280 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-06 10:05:28,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-06 10:05:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:05:28,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:05:28,284 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash -27954641, now seen corresponding path program 1 times [2025-02-06 10:05:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344090390] [2025-02-06 10:05:28,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:05:28,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:05:28,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344090390] [2025-02-06 10:05:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344090390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224339191] [2025-02-06 10:05:28,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:28,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:28,402 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,430 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-02-06 10:05:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:28,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:05:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,431 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:05:28,431 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:05:28,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:28,431 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:05:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 10:05:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-06 10:05:28,434 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 16 [2025-02-06 10:05:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,434 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 10:05:28,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-06 10:05:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:05:28,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:05:28,435 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -864868942, now seen corresponding path program 1 times [2025-02-06 10:05:28,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305968548] [2025-02-06 10:05:28,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:28,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305968548] [2025-02-06 10:05:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305968548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789396914] [2025-02-06 10:05:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:28,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:28,499 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,542 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-02-06 10:05:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:28,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:05:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,543 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:05:28,543 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:05:28,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:28,543 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:05:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:05:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-02-06 10:05:28,546 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2025-02-06 10:05:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-02-06 10:05:28,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-02-06 10:05:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:05:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:05:28,547 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash -864868941, now seen corresponding path program 1 times [2025-02-06 10:05:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901903747] [2025-02-06 10:05:28,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:28,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:28,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901903747] [2025-02-06 10:05:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901903747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:05:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459530723] [2025-02-06 10:05:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:28,693 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,791 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-06 10:05:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:05:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,792 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:28,792 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:28,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:28,793 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:28,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-02-06 10:05:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-02-06 10:05:28,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 17 [2025-02-06 10:05:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,795 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-02-06 10:05:28,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-02-06 10:05:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:05:28,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,796 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:05:28,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1446067361, now seen corresponding path program 1 times [2025-02-06 10:05:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419163690] [2025-02-06 10:05:28,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:05:28,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:05:28,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419163690] [2025-02-06 10:05:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419163690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477371470] [2025-02-06 10:05:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:28,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:28,824 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-02-06 10:05:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:28,833 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-02-06 10:05:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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) Word has length 22 [2025-02-06 10:05:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:28,834 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:05:28,834 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:05:28,834 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-02-06 10:05:28,835 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 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-02-06 10:05:28,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:05:28,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 10:05:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-02-06 10:05:28,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 22 [2025-02-06 10:05:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:28,839 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-02-06 10:05:28,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-02-06 10:05:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-02-06 10:05:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:05:28,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:28,839 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:05:28,840 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1925758685, now seen corresponding path program 1 times [2025-02-06 10:05:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399930385] [2025-02-06 10:05:28,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:28,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:05:28,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:28,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:28,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:05:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399930385] [2025-02-06 10:05:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399930385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:05:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881048908] [2025-02-06 10:05:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:29,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:29,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:29,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:29,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:29,006 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:29,042 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-06 10:05:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:05:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 24 [2025-02-06 10:05:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:29,043 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:05:29,043 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 10:05:29,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:29,044 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:29,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 10:05:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 10:05:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-02-06 10:05:29,046 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 24 [2025-02-06 10:05:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:29,046 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-02-06 10:05:29,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-02-06 10:05:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:05:29,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:29,047 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:29,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:05:29,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 331152322, now seen corresponding path program 1 times [2025-02-06 10:05:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499547528] [2025-02-06 10:05:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:05:29,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:05:29,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499547528] [2025-02-06 10:05:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499547528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:29,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:05:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311220338] [2025-02-06 10:05:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:29,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:05:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:29,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:05:29,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:29,199 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:29,245 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2025-02-06 10:05:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:29,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 24 [2025-02-06 10:05:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:29,246 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:05:29,246 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:05:29,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:29,247 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:29,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 163 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:05:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-06 10:05:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-02-06 10:05:29,249 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 24 [2025-02-06 10:05:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:29,249 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-06 10:05:29,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-02-06 10:05:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:29,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:29,250 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:29,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:05:29,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:29,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1154681993, now seen corresponding path program 1 times [2025-02-06 10:05:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:29,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190794963] [2025-02-06 10:05:29,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:29,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:29,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:29,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:29,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:29,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190794963] [2025-02-06 10:05:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190794963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:29,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:29,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:05:29,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925834413] [2025-02-06 10:05:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:05:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:29,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:05:29,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:29,438 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:29,522 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2025-02-06 10:05:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 27 [2025-02-06 10:05:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:29,523 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:05:29,523 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:05:29,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:05:29,525 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:29,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 204 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:05:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-06 10:05:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-06 10:05:29,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 27 [2025-02-06 10:05:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-06 10:05:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-06 10:05:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:29,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:29,532 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:29,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:05:29,532 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1180325733, now seen corresponding path program 1 times [2025-02-06 10:05:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832812936] [2025-02-06 10:05:29,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:29,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:29,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:29,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:29,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:29,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832812936] [2025-02-06 10:05:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832812936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:05:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50130348] [2025-02-06 10:05:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:29,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:05:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:29,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:05:29,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:05:29,637 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:29,748 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-02-06 10:05:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 27 [2025-02-06 10:05:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:29,749 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:05:29,749 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:05:29,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:05:29,750 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:29,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:05:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 10:05:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-06 10:05:29,752 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2025-02-06 10:05:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-06 10:05:29,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-06 10:05:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:29,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:29,753 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:29,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:05:29,753 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:29,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1087675240, now seen corresponding path program 1 times [2025-02-06 10:05:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437488469] [2025-02-06 10:05:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:29,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:29,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:29,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:29,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437488469] [2025-02-06 10:05:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437488469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:29,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:05:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569519672] [2025-02-06 10:05:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:29,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:05:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:29,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:05:29,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:05:29,977 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:30,078 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-02-06 10:05:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:05:30,079 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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 27 [2025-02-06 10:05:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:30,079 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:05:30,079 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:05:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:05:30,080 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:30,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 195 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:05:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-06 10:05:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-06 10:05:30,082 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 27 [2025-02-06 10:05:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:30,082 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-06 10:05:30,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-06 10:05:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:05:30,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:30,084 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:30,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:05:30,084 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:30,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:30,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1678370021, now seen corresponding path program 1 times [2025-02-06 10:05:30,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362171739] [2025-02-06 10:05:30,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:30,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:05:30,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:05:30,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:30,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362171739] [2025-02-06 10:05:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362171739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896380406] [2025-02-06 10:05:30,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:30,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:30,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:05:30,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:05:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:05:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:30,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:05:30,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:30,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:30,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896380406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:30,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-02-06 10:05:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887197848] [2025-02-06 10:05:30,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:30,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:05:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:30,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:05:30,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:05:30,720 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:30,911 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-02-06 10:05:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:05:30,912 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 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 30 [2025-02-06 10:05:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:30,912 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:30,912 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:05:30,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:05:30,913 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:30,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 220 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:05:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2025-02-06 10:05:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-06 10:05:30,915 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2025-02-06 10:05:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:30,915 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-06 10:05:30,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-06 10:05:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:05:30,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:30,916 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:30,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:05:31,120 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:31,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1995558077, now seen corresponding path program 1 times [2025-02-06 10:05:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225346893] [2025-02-06 10:05:31,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:05:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:05:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:31,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:31,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:31,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225346893] [2025-02-06 10:05:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225346893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776533579] [2025-02-06 10:05:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:31,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:31,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:05:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:05:31,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:05:31,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:31,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:31,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:05:31,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:31,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:31,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776533579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:31,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 10:05:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076932751] [2025-02-06 10:05:31,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:05:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:31,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:05:31,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:05:31,648 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:31,767 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-02-06 10:05:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:31,771 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:05:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:31,772 INFO L225 Difference]: With dead ends: 91 [2025-02-06 10:05:31,772 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:05:31,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:05:31,773 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:31,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 180 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:05:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2025-02-06 10:05:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.140625) internal successors, (73), 65 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2025-02-06 10:05:31,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 32 [2025-02-06 10:05:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:31,777 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2025-02-06 10:05:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.8125) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2025-02-06 10:05:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:05:31,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:31,778 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:31,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 10:05:31,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1420401231, now seen corresponding path program 2 times [2025-02-06 10:05:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625426184] [2025-02-06 10:05:31,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:31,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:31,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:05:32,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:05:32,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:32,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625426184] [2025-02-06 10:05:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625426184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233972866] [2025-02-06 10:05:32,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:32,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:32,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:32,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:32,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:05:32,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:05:32,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:05:32,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:32,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:32,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:05:32,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:32,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:32,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:32,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:32,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233972866] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:32,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:32,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2025-02-06 10:05:32,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112462669] [2025-02-06 10:05:32,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:32,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:05:32,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:32,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:05:32,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:05:32,899 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:33,488 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2025-02-06 10:05:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:05:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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 37 [2025-02-06 10:05:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:33,489 INFO L225 Difference]: With dead ends: 143 [2025-02-06 10:05:33,489 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 10:05:33,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:05:33,491 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 97 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:33,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 399 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 10:05:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2025-02-06 10:05:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-02-06 10:05:33,496 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 37 [2025-02-06 10:05:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:33,496 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-02-06 10:05:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-02-06 10:05:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:05:33,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:33,499 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:33,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:33,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 10:05:33,699 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:33,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 635712849, now seen corresponding path program 2 times [2025-02-06 10:05:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304752989] [2025-02-06 10:05:33,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:33,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:05:33,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:05:33,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:33,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304752989] [2025-02-06 10:05:34,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304752989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912704248] [2025-02-06 10:05:34,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:34,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:34,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:34,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:05:34,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:05:34,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:05:34,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:34,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:34,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 10:05:34,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:34,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:34,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 10:05:34,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:34,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912704248] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:34,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:34,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 12] total 29 [2025-02-06 10:05:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340265875] [2025-02-06 10:05:34,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:34,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:05:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:34,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:05:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:05:34,877 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:35,183 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2025-02-06 10:05:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:05:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 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 46 [2025-02-06 10:05:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:35,184 INFO L225 Difference]: With dead ends: 185 [2025-02-06 10:05:35,184 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:05:35,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:05:35,185 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:35,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 377 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:05:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2025-02-06 10:05:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.103225806451613) internal successors, (171), 156 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-02-06 10:05:35,193 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 46 [2025-02-06 10:05:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:35,193 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-02-06 10:05:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-02-06 10:05:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:05:35,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:35,194 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:35,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:35,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:35,394 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:35,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash -695539832, now seen corresponding path program 3 times [2025-02-06 10:05:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032351818] [2025-02-06 10:05:35,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:35,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 4 equivalence classes. [2025-02-06 10:05:35,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:05:35,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:05:35,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:37,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:37,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032351818] [2025-02-06 10:05:37,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032351818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:37,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588027462] [2025-02-06 10:05:37,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:37,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:37,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:37,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:05:37,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 4 equivalence classes. [2025-02-06 10:05:37,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:05:37,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:05:37,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:37,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:05:37,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:37,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:05:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:37,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:37,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-06 10:05:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588027462] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:37,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 35 [2025-02-06 10:05:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648246552] [2025-02-06 10:05:37,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:05:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:37,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:05:37,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:05:37,965 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:39,464 INFO L93 Difference]: Finished difference Result 253 states and 270 transitions. [2025-02-06 10:05:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 10:05:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 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 47 [2025-02-06 10:05:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:39,466 INFO L225 Difference]: With dead ends: 253 [2025-02-06 10:05:39,466 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:05:39,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=311, Invalid=3349, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 10:05:39,468 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 148 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:39,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 441 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:05:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:05:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 210. [2025-02-06 10:05:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 1.0961538461538463) internal successors, (228), 209 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2025-02-06 10:05:39,478 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 47 [2025-02-06 10:05:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:39,478 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2025-02-06 10:05:39,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2025-02-06 10:05:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:05:39,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:39,481 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:39,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:05:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:05:39,682 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1557300662, now seen corresponding path program 3 times [2025-02-06 10:05:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215104116] [2025-02-06 10:05:39,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:39,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 3 equivalence classes. [2025-02-06 10:05:39,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:05:39,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:39,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215104116] [2025-02-06 10:05:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215104116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708769733] [2025-02-06 10:05:39,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:39,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:05:40,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 3 equivalence classes. [2025-02-06 10:05:40,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:05:40,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:40,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 10:05:40,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:40,066 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-02-06 10:05:40,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:05:40,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:05:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:40,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708769733] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:40,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-02-06 10:05:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162912822] [2025-02-06 10:05:40,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:40,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:05:40,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:40,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:05:40,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:05:40,559 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:40,833 INFO L93 Difference]: Finished difference Result 337 states and 362 transitions. [2025-02-06 10:05:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:05:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 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 49 [2025-02-06 10:05:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:40,835 INFO L225 Difference]: With dead ends: 337 [2025-02-06 10:05:40,835 INFO L226 Difference]: Without dead ends: 337 [2025-02-06 10:05:40,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:05:40,836 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 76 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:40,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 355 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-06 10:05:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 275. [2025-02-06 10:05:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 273 states have (on average 1.0915750915750915) internal successors, (298), 274 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 298 transitions. [2025-02-06 10:05:40,849 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 298 transitions. Word has length 49 [2025-02-06 10:05:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:40,850 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 298 transitions. [2025-02-06 10:05:40,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.25) internal successors, (126), 25 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 298 transitions. [2025-02-06 10:05:40,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:05:40,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:40,850 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:40,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:05:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:41,051 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash 301043845, now seen corresponding path program 4 times [2025-02-06 10:05:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142706744] [2025-02-06 10:05:41,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:41,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:41,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-06 10:05:41,072 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 50 statements. [2025-02-06 10:05:41,073 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:41,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142706744] [2025-02-06 10:05:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142706744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608903447] [2025-02-06 10:05:41,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:41,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:41,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:41,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:05:41,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-06 10:05:41,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 50 statements. [2025-02-06 10:05:41,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:42,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:05:42,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:42,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:05:43,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:43,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 121 [2025-02-06 10:05:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:05:43,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:44,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-06 10:05:44,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2025-02-06 10:05:44,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 10:05:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608903447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:44,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:44,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 50 [2025-02-06 10:05:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111101712] [2025-02-06 10:05:44,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:44,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:05:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:44,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:05:44,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2284, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:05:44,272 INFO L87 Difference]: Start difference. First operand 275 states and 298 transitions. Second operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:46,962 INFO L93 Difference]: Finished difference Result 310 states and 333 transitions. [2025-02-06 10:05:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:05:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 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 50 [2025-02-06 10:05:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:46,963 INFO L225 Difference]: With dead ends: 310 [2025-02-06 10:05:46,963 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 10:05:46,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=703, Invalid=4127, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 10:05:46,965 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 73 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:46,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 378 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:05:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 10:05:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 185. [2025-02-06 10:05:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.0706521739130435) internal successors, (197), 184 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-02-06 10:05:46,970 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 50 [2025-02-06 10:05:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-02-06 10:05:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-02-06 10:05:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:05:46,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:46,971 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:46,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:05:47,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:47,172 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:47,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1203649916, now seen corresponding path program 4 times [2025-02-06 10:05:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197731712] [2025-02-06 10:05:47,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:47,182 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:05:47,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 63 statements. [2025-02-06 10:05:47,193 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:47,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:05:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197731712] [2025-02-06 10:05:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197731712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272660593] [2025-02-06 10:05:47,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:47,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:47,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:47,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:05:47,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:05:47,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:05:47,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 63 statements. [2025-02-06 10:05:47,840 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:47,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-06 10:05:47,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:47,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:05:49,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 135 [2025-02-06 10:05:49,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:49,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2025-02-06 10:05:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:05:50,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:50,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:50,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-06 10:05:51,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2025-02-06 10:05:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2025-02-06 10:05:51,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-06 10:05:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:05:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272660593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:51,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 20] total 49 [2025-02-06 10:05:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248703323] [2025-02-06 10:05:51,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:05:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:05:51,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2087, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 10:05:51,058 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 50 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:55,194 INFO L93 Difference]: Finished difference Result 375 states and 397 transitions. [2025-02-06 10:05:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-02-06 10:05:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 50 states have internal predecessors, (152), 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 63 [2025-02-06 10:05:55,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:55,195 INFO L225 Difference]: With dead ends: 375 [2025-02-06 10:05:55,195 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:05:55,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1754, Invalid=6436, Unknown=0, NotChecked=0, Total=8190 [2025-02-06 10:05:55,197 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 165 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:55,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 729 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:05:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:05:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:05:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:05:55,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-02-06 10:05:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:55,199 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:05:55,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 50 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:05:55,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:05:55,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2025-02-06 10:05:55,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2025-02-06 10:05:55,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2025-02-06 10:05:55,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2025-02-06 10:05:55,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2025-02-06 10:05:55,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2025-02-06 10:05:55,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2025-02-06 10:05:55,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-02-06 10:05:55,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-02-06 10:05:55,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2025-02-06 10:05:55,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2025-02-06 10:05:55,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:05:55,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-02-06 10:05:55,411 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:55,412 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:05:55,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:05:55 BoogieIcfgContainer [2025-02-06 10:05:55,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:05:55,415 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:05:55,415 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:05:55,415 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:05:55,415 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:22" (3/4) ... [2025-02-06 10:05:55,417 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:05:55,423 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 10:05:55,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 10:05:55,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 10:05:55,424 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:05:55,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:05:55,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:05:55,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:05:55,499 INFO L158 Benchmark]: Toolchain (without parser) took 33969.42ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 113.8MB in the beginning and 139.8MB in the end (delta: -26.1MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2025-02-06 10:05:55,499 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:05:55,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.81ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 96.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:05:55,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.96ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:05:55,499 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:05:55,499 INFO L158 Benchmark]: IcfgBuilder took 375.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 76.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:05:55,500 INFO L158 Benchmark]: TraceAbstraction took 33040.94ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.8MB in the beginning and 147.5MB in the end (delta: -71.7MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2025-02-06 10:05:55,500 INFO L158 Benchmark]: Witness Printer took 83.68ms. Allocated memory is still 327.2MB. Free memory was 147.5MB in the beginning and 139.8MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:05:55,503 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.81ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 96.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.96ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 375.72ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 76.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33040.94ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 75.8MB in the beginning and 147.5MB in the end (delta: -71.7MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. * Witness Printer took 83.68ms. Allocated memory is still 327.2MB. Free memory was 147.5MB in the beginning and 139.8MB in the end (delta: 7.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 - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 32, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1226 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1226 mSDsluCounter, 6190 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5068 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5947 IncrementalHoareTripleChecker+Invalid, 6026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1122 mSDtfsCounter, 5947 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1139 GetRequests, 624 SyntacticMatches, 9 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4916 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=30, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 299 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 1076 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1408 ConstructedInterpolants, 71 QuantifiedInterpolants, 19337 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 177/606 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:05:55,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE