./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/substring-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/substring-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 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:08:17,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:08:17,335 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:08:17,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:08:17,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:08:17,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:08:17,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:08:17,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:08:17,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:08:17,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:08:17,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:08:17,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:08:17,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:08:17,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:08:17,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:08:17,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:08:17,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:08:17,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:08:17,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:08:17,363 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 -> 4cb6276eff0c60579b1d5f7034948eb4f53891709ff48cdd11b3329ec3c4cc2e [2025-02-06 10:08:17,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:08:17,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:08:17,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:08:17,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:08:17,602 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:08:17,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2025-02-06 10:08:18,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10599ab0e/eeab10e6630e445aa6dcafe30613c685/FLAG9d7f195a5 [2025-02-06 10:08:19,024 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:08:19,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/substring-alloca-2.i [2025-02-06 10:08:19,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10599ab0e/eeab10e6630e445aa6dcafe30613c685/FLAG9d7f195a5 [2025-02-06 10:08:19,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10599ab0e/eeab10e6630e445aa6dcafe30613c685 [2025-02-06 10:08:19,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:08:19,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:08:19,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:08:19,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:08:19,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:08:19,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19, skipping insertion in model container [2025-02-06 10:08:19,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:08:19,525 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:08:19,525 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:08:19,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:08:19,538 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:08:19,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:08:19,581 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:08:19,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19 WrapperNode [2025-02-06 10:08:19,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:08:19,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:08:19,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:08:19,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:08:19,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,604 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 102 [2025-02-06 10:08:19,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:08:19,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:08:19,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:08:19,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:08:19,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,624 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:08:19,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:08:19,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:08:19,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:08:19,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:08:19,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (1/1) ... [2025-02-06 10:08:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:08:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:19,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:08:19,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:08:19,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:08:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:08:19,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:08:19,746 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:08:19,747 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:08:19,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~ret19#1;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset;call ULTIMATE.dealloc(main_#t~malloc14#1.base, main_#t~malloc14#1.offset);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; [2025-02-06 10:08:19,902 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-02-06 10:08:19,902 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:08:19,910 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:08:19,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:08:19,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:08:19 BoogieIcfgContainer [2025-02-06 10:08:19,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:08:19,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:08:19,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:08:19,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:08:19,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:08:19" (1/3) ... [2025-02-06 10:08:19,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc91576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:08:19, skipping insertion in model container [2025-02-06 10:08:19,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:08:19" (2/3) ... [2025-02-06 10:08:19,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc91576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:08:19, skipping insertion in model container [2025-02-06 10:08:19,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:08:19" (3/3) ... [2025-02-06 10:08:19,919 INFO L128 eAbstractionObserver]: Analyzing ICFG substring-alloca-2.i [2025-02-06 10:08:19,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:08:19,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG substring-alloca-2.i that has 1 procedures, 51 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-06 10:08:19,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:08:19,964 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;@2851b9dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:08:19,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 10:08:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.935483870967742) internal successors, (60), 50 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:08:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:08:19,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:19,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:19,972 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:08:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -351298659, now seen corresponding path program 1 times [2025-02-06 10:08:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-02-06 10:08:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:19,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:08:20,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:08:20,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557369592] [2025-02-06 10:08:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557369592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:20,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596250863] [2025-02-06 10:08:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:20,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:20,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:20,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:20,202 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.935483870967742) internal successors, (60), 50 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) 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:08:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:20,243 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-02-06 10:08:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:20,247 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:08:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:20,252 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:08:20,252 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:08:20,253 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:08:20,256 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:20,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 149 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:20,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:08:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-02-06 10:08:20,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.8181818181818181) 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:08:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-02-06 10:08:20,286 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 7 [2025-02-06 10:08:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-02-06 10:08:20,286 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:08:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-02-06 10:08:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:08:20,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:20,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:08:20,288 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:08:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -350375138, now seen corresponding path program 1 times [2025-02-06 10:08:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57721679] [2025-02-06 10:08:20,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:08:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:08:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57721679] [2025-02-06 10:08:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57721679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:08:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751825254] [2025-02-06 10:08:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:08:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:20,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:08:20,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:08:20,484 INFO L87 Difference]: Start difference. First operand 52 states and 60 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:08:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:20,532 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-02-06 10:08:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:08:20,533 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:08:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:20,533 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:08:20,534 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:08:20,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:08:20,535 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 67 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:20,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:08:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 10:08:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7575757575757576) 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:08:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-06 10:08:20,540 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 7 [2025-02-06 10:08:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:20,540 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 10:08:20,540 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:08:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-06 10:08:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:08:20,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:20,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:08:20,541 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:08:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -350375137, now seen corresponding path program 1 times [2025-02-06 10:08:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225114586] [2025-02-06 10:08:20,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:20,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:08:20,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:08:20,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:20,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:20,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225114586] [2025-02-06 10:08:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225114586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:20,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322793583] [2025-02-06 10:08:20,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:20,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:20,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:20,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:20,729 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:20,817 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-02-06 10:08:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:08:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:20,819 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:08:20,819 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:08:20,819 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:08:20,819 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:20,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 136 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:08:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-02-06 10:08:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.7428571428571429) 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:08:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-06 10:08:20,828 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 7 [2025-02-06 10:08:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:20,828 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-06 10:08:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-06 10:08:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:08:20,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:20,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:20,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:08:20,829 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:08:20,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1994638424, now seen corresponding path program 1 times [2025-02-06 10:08:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814883044] [2025-02-06 10:08:20,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:20,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:20,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:08:20,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:08:20,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:20,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814883044] [2025-02-06 10:08:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814883044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:20,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:20,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271946085] [2025-02-06 10:08:20,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:20,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:20,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:20,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:20,942 INFO L87 Difference]: Start difference. First operand 52 states and 61 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:08:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:20,994 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2025-02-06 10:08:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:20,995 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:08:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:20,995 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:08:20,995 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:08:20,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:20,996 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:20,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:08:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-06 10:08:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-02-06 10:08:20,998 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 8 [2025-02-06 10:08:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:21,002 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-02-06 10:08:21,002 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:08:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2025-02-06 10:08:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:08:21,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:21,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:21,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:08:21,003 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:08:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1994638583, now seen corresponding path program 1 times [2025-02-06 10:08:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140138046] [2025-02-06 10:08:21,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:08:21,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:08:21,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140138046] [2025-02-06 10:08:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140138046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523217052] [2025-02-06 10:08:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:21,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:21,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:21,127 INFO L87 Difference]: Start difference. First operand 56 states and 68 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:08:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:21,192 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2025-02-06 10:08:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:21,192 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:08:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:21,193 INFO L225 Difference]: With dead ends: 55 [2025-02-06 10:08:21,193 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:08:21,193 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:08:21,194 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 128 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:08:21,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 128 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:08:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-02-06 10:08:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 53 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:08:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-02-06 10:08:21,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 8 [2025-02-06 10:08:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:21,200 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-02-06 10:08:21,200 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:08:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-02-06 10:08:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:08:21,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:21,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:21,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:08:21,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:21,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1994638584, now seen corresponding path program 1 times [2025-02-06 10:08:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-02-06 10:08:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:08:21,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:08:21,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:21,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:21,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-02-06 10:08:21,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563583361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:21,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:21,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:08:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350456147] [2025-02-06 10:08:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:08:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:08:21,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:08:21,309 INFO L87 Difference]: Start difference. First operand 54 states and 65 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:08:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:21,385 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-02-06 10:08:21,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:08:21,385 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:08:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:21,386 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:08:21,386 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:08:21,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:21,386 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:21,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:08:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-02-06 10:08:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-02-06 10:08:21,394 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 8 [2025-02-06 10:08:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:21,394 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-02-06 10:08:21,394 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:08:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-02-06 10:08:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:08:21,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:21,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:08:21,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2023267575, now seen corresponding path program 1 times [2025-02-06 10:08:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769205766] [2025-02-06 10:08:21,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:08:21,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:08:21,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769205766] [2025-02-06 10:08:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769205766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528526668] [2025-02-06 10:08:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:21,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:21,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:21,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:21,507 INFO L87 Difference]: Start difference. First operand 58 states and 71 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:08:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:21,548 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-02-06 10:08:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:21,548 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:08:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:21,549 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:08:21,549 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:08:21,549 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:08:21,549 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:21,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 103 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:08:21,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-02-06 10:08:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-02-06 10:08:21,552 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 8 [2025-02-06 10:08:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:21,552 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-02-06 10:08:21,552 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:08:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-02-06 10:08:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:08:21,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:21,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:21,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:08:21,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:21,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1704248984, now seen corresponding path program 1 times [2025-02-06 10:08:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239028447] [2025-02-06 10:08:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:08:21,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:08:21,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:21,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239028447] [2025-02-06 10:08:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239028447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:21,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460040704] [2025-02-06 10:08:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:21,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:21,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:21,656 INFO L87 Difference]: Start difference. First operand 58 states and 71 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:08:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:21,686 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2025-02-06 10:08:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:21,686 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:08:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:21,687 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:08:21,687 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:08:21,687 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:08:21,687 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:08:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 10:08:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.627906976744186) internal successors, (70), 56 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:08:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-02-06 10:08:21,690 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 9 [2025-02-06 10:08:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:21,690 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-02-06 10:08:21,690 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:08:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-02-06 10:08:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:08:21,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:21,693 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:21,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:08:21,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1255179941, now seen corresponding path program 1 times [2025-02-06 10:08:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421789814] [2025-02-06 10:08:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:08:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:08:21,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:21,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421789814] [2025-02-06 10:08:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421789814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108159441] [2025-02-06 10:08:21,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:21,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:21,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:21,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:08:21,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:08:21,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:08:21,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:21,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:21,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:08:21,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:21,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:08:21,957 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:08:21,967 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:08:22,084 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:08:22,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:22,239 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:08:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108159441] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:22,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-06 10:08:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632085897] [2025-02-06 10:08:22,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:08:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:22,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:08:22,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:08:22,255 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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:08:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:22,423 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2025-02-06 10:08:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:08:22,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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:08:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:22,423 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:08:22,423 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:08:22,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:08:22,424 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 12 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:22,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 221 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:08:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-02-06 10:08:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.619047619047619) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-02-06 10:08:22,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 10 [2025-02-06 10:08:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-02-06 10:08:22,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 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:08:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-02-06 10:08:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:08:22,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:22,427 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:22,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:08:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:22,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:22,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1405506972, now seen corresponding path program 1 times [2025-02-06 10:08:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:22,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-02-06 10:08:22,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:22,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:08:22,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:08:22,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:22,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-02-06 10:08:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155636600] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046247536] [2025-02-06 10:08:22,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:22,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:22,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:22,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:08:22,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:08:22,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:08:22,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:22,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:22,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 10:08:22,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:22,908 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:08:22,914 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 8 treesize of output 1 [2025-02-06 10:08:23,046 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:08:23,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046247536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:23,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-02-06 10:08:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539910099] [2025-02-06 10:08:23,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:23,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:08:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:23,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:08:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:08:23,200 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:23,373 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-02-06 10:08:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:08:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:08:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:23,375 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:08:23,375 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:08:23,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:08:23,376 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:23,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 225 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:08:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2025-02-06 10:08:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 49 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:08:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-02-06 10:08:23,378 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 11 [2025-02-06 10:08:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-02-06 10:08:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-02-06 10:08:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:08:23,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:23,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:23,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:23,584 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:23,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -255877573, now seen corresponding path program 1 times [2025-02-06 10:08:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-02-06 10:08:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:08:23,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:08:23,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:23,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:23,763 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:08:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87861491] [2025-02-06 10:08:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87861491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:23,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:23,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:08:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461662507] [2025-02-06 10:08:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:23,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:08:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:23,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:08:23,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:23,765 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:08:23,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:23,800 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2025-02-06 10:08:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:08:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:08:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:23,801 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:08:23,801 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:08:23,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:23,801 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:23,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:08:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-02-06 10:08:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-02-06 10:08:23,803 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 11 [2025-02-06 10:08:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:23,803 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-02-06 10:08:23,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:08:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-02-06 10:08:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:08:23,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:23,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:08:23,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 473059379, now seen corresponding path program 1 times [2025-02-06 10:08:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657891642] [2025-02-06 10:08:23,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:23,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:08:23,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:08:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657891642] [2025-02-06 10:08:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657891642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:23,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975085105] [2025-02-06 10:08:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:23,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:23,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:23,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:23,856 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:23,887 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-06 10:08:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:08:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:23,888 INFO L225 Difference]: With dead ends: 43 [2025-02-06 10:08:23,888 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 10:08:23,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:23,889 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:23,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 10:08:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 10:08:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-06 10:08:23,891 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 12 [2025-02-06 10:08:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:23,891 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-06 10:08:23,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-06 10:08:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:08:23,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:23,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:08:23,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:23,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 473059380, now seen corresponding path program 1 times [2025-02-06 10:08:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:23,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-02-06 10:08:23,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:23,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:08:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:08:23,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:23,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-02-06 10:08:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094174108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:23,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:08:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673138017] [2025-02-06 10:08:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:08:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:23,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:08:23,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:08:23,974 INFO L87 Difference]: Start difference. First operand 43 states and 51 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:08:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,047 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-02-06 10:08:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:08:24,048 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:08:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,048 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:08:24,048 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:08:24,048 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:08:24,049 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 126 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:08:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2025-02-06 10:08:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 44 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:08:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-02-06 10:08:24,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2025-02-06 10:08:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,055 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-06 10:08:24,055 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:08:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-02-06 10:08:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:08:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:08:24,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1124268401, now seen corresponding path program 1 times [2025-02-06 10:08:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837559484] [2025-02-06 10:08:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:08:24,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:08:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:24,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837559484] [2025-02-06 10:08:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837559484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780069766] [2025-02-06 10:08:24,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:24,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:24,135 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,206 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-02-06 10:08:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-02-06 10:08:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,208 INFO L225 Difference]: With dead ends: 42 [2025-02-06 10:08:24,208 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 10:08:24,209 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:08:24,209 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 69 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 10:08:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-06 10:08:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 41 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:08:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-02-06 10:08:24,211 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2025-02-06 10:08:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,211 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-02-06 10:08:24,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-02-06 10:08:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:08:24,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:24,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:08:24,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1124268402, now seen corresponding path program 1 times [2025-02-06 10:08:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-02-06 10:08:24,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:08:24,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:08:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:24,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-02-06 10:08:24,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006121309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:08:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815497735] [2025-02-06 10:08:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:08:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:08:24,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:24,387 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,502 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-06 10:08:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:08:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2025-02-06 10:08:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,503 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:08:24,504 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:08:24,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:08:24,505 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 96 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:08:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2025-02-06 10:08:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-02-06 10:08:24,509 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 15 [2025-02-06 10:08:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-02-06 10:08:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-02-06 10:08:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:08:24,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,510 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:08:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:08:24,511 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:08:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 492526481, now seen corresponding path program 1 times [2025-02-06 10:08:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-02-06 10:08:24,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:08:24,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:08:24,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-02-06 10:08:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798777952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546822345] [2025-02-06 10:08:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:08:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:08:24,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:24,605 INFO L87 Difference]: Start difference. First operand 51 states and 63 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:08:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,624 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2025-02-06 10:08:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:08:24,625 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:08:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,625 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:08:24,625 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:08:24,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:08:24,626 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 60 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:08:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:08:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 46 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:08:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-06 10:08:24,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 16 [2025-02-06 10:08:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,630 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-06 10:08:24,631 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:08:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-06 10:08:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:08:24,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:24,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:08:24,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1391075252, now seen corresponding path program 1 times [2025-02-06 10:08:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-02-06 10:08:24,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:08:24,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:08:24,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001586961] [2025-02-06 10:08:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001586961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:08:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273274367] [2025-02-06 10:08:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:08:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:08:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:08:24,680 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,717 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-02-06 10:08:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:08:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:08:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,718 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:08:24,718 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:08:24,718 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:08:24,718 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:08:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:08:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-02-06 10:08:24,720 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 19 [2025-02-06 10:08:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,720 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-02-06 10:08:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-02-06 10:08:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:08:24,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:24,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:08:24,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1391075251, now seen corresponding path program 1 times [2025-02-06 10:08:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-02-06 10:08:24,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:08:24,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:08:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444401558] [2025-02-06 10:08:24,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444401558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:08:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977235876] [2025-02-06 10:08:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:08:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:08:24,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:24,820 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,921 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2025-02-06 10:08:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:08:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:08:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,923 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:08:24,923 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:08:24,923 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:08:24,924 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:24,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 98 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:08:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2025-02-06 10:08:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 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:08:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-02-06 10:08:24,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 19 [2025-02-06 10:08:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,927 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-02-06 10:08:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-02-06 10:08:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:08:24,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,928 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:24,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:08:24,928 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -173634494, now seen corresponding path program 1 times [2025-02-06 10:08:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465125985] [2025-02-06 10:08:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:08:24,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:08:24,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:24,950 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:08:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465125985] [2025-02-06 10:08:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465125985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:08:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196898] [2025-02-06 10:08:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:24,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:08:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:24,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:08:24,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:08:24,952 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:24,957 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2025-02-06 10:08:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:08:24,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:08:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:24,958 INFO L225 Difference]: With dead ends: 55 [2025-02-06 10:08:24,958 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:08:24,958 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:08:24,959 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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:08:24,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:08:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 10:08:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-06 10:08:24,961 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 20 [2025-02-06 10:08:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:24,961 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-06 10:08:24,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-06 10:08:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:08:24,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:24,961 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:08:24,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:08:24,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 639438560, now seen corresponding path program 1 times [2025-02-06 10:08:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-06 10:08:24,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:08:24,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:08:24,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:24,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:25,003 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:08:25,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:25,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-02-06 10:08:25,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:25,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:25,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:08:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148396904] [2025-02-06 10:08:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:25,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:08:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:25,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:08:25,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:08:25,004 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:08:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:25,033 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-02-06 10:08:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:08:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:08:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:25,034 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:08:25,034 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:08:25,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:08:25,034 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:25,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:08:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 10:08:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.28) internal successors, (64), 54 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:08:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-02-06 10:08:25,036 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 22 [2025-02-06 10:08:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:25,036 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-02-06 10:08:25,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:08:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-02-06 10:08:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:08:25,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:25,036 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] [2025-02-06 10:08:25,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:08:25,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1934601577, now seen corresponding path program 1 times [2025-02-06 10:08:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:25,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-02-06 10:08:25,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:25,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:08:25,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:08:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:25,249 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:08:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139595065] [2025-02-06 10:08:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139595065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:08:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715133459] [2025-02-06 10:08:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:08:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:25,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:08:25,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:08:25,251 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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:08:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:25,405 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2025-02-06 10:08:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:08:25,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 23 [2025-02-06 10:08:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:25,406 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:08:25,406 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:08:25,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:08:25,407 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:25,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 231 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:08:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-06 10:08:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 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:08:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-02-06 10:08:25,408 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 23 [2025-02-06 10:08:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:25,409 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-02-06 10:08:25,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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:08:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-02-06 10:08:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:08:25,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:25,409 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] [2025-02-06 10:08:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:08:25,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2145952490, now seen corresponding path program 1 times [2025-02-06 10:08:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288720222] [2025-02-06 10:08:25,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:08:25,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:08:25,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:25,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:25,614 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:08:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288720222] [2025-02-06 10:08:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288720222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:08:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438046205] [2025-02-06 10:08:25,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:08:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:25,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:08:25,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:08:25,615 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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:08:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:25,781 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-02-06 10:08:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:08:25,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 23 [2025-02-06 10:08:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:25,782 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:08:25,782 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:08:25,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:08:25,783 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:25,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 227 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:08:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2025-02-06 10:08:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 72 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:08:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2025-02-06 10:08:25,788 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 23 [2025-02-06 10:08:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:25,788 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2025-02-06 10:08:25,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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:08:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2025-02-06 10:08:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:08:25,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:25,788 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] [2025-02-06 10:08:25,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:08:25,788 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:08:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash -570260921, now seen corresponding path program 1 times [2025-02-06 10:08:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-02-06 10:08:25,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:25,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:08:25,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:08:25,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:25,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:25,896 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:08:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:25,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167119661] [2025-02-06 10:08:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167119661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:25,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:25,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:08:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872605618] [2025-02-06 10:08:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:08:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:25,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:08:25,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:08:25,898 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:08:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:25,925 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-02-06 10:08:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:08:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 25 [2025-02-06 10:08:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:25,926 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:08:25,926 INFO L226 Difference]: Without dead ends: 70 [2025-02-06 10:08:25,926 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:08:25,926 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 154 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:08:25,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 154 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-06 10:08:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-06 10:08:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 69 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:08:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-02-06 10:08:25,928 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 25 [2025-02-06 10:08:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-02-06 10:08:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:08:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-02-06 10:08:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:08:25,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:25,929 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] [2025-02-06 10:08:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:08:25,929 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 674503560, now seen corresponding path program 1 times [2025-02-06 10:08:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-02-06 10:08:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:25,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:08:25,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:08:25,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:26,056 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:08:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168016960] [2025-02-06 10:08:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168016960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:08:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734924782] [2025-02-06 10:08:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:08:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:26,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:08:26,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:08:26,057 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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:08:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:26,098 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-06 10:08:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:08:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 25 [2025-02-06 10:08:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:26,099 INFO L225 Difference]: With dead ends: 64 [2025-02-06 10:08:26,099 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 10:08:26,099 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:08:26,100 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:26,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 184 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:08:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 10:08:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-02-06 10:08:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 52 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:08:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-02-06 10:08:26,101 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 25 [2025-02-06 10:08:26,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:26,101 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-02-06 10:08:26,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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:08:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-02-06 10:08:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:08:26,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:26,102 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] [2025-02-06 10:08:26,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:08:26,102 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:26,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1367240998, now seen corresponding path program 1 times [2025-02-06 10:08:26,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:26,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-02-06 10:08:26,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:26,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:08:26,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:08:26,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:26,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:26,256 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:08:26,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-02-06 10:08:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163986276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:08:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:08:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:08:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611663376] [2025-02-06 10:08:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:08:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:08:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:26,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:08:26,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:08:26,258 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:26,337 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2025-02-06 10:08:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:08:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:08:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:26,338 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:08:26,338 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 10:08:26,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:08:26,339 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:26,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 211 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 10:08:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-02-06 10:08:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 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:08:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-02-06 10:08:26,341 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 26 [2025-02-06 10:08:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-02-06 10:08:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-02-06 10:08:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:08:26,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:26,341 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] [2025-02-06 10:08:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:08:26,342 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:26,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 679053160, now seen corresponding path program 1 times [2025-02-06 10:08:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782354745] [2025-02-06 10:08:26,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:26,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:08:26,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:08:26,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:26,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:26,532 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:08:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782354745] [2025-02-06 10:08:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782354745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839204357] [2025-02-06 10:08:26,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:26,538 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:08:26,539 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:08:26,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:08:26,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:08:26,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:26,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:26,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:08:26,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:26,742 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:08:26,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:26,913 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:08:26,937 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:08:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839204357] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:26,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2025-02-06 10:08:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577503422] [2025-02-06 10:08:26,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:26,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 10:08:26,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:26,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 10:08:26,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:08:26,939 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 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:08:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:27,177 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-02-06 10:08:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:08:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 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) Word has length 29 [2025-02-06 10:08:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:27,178 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:08:27,178 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:08:27,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:08:27,179 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 104 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:27,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 211 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:08:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2025-02-06 10:08:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-02-06 10:08:27,181 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 29 [2025-02-06 10:08:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:27,182 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-02-06 10:08:27,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 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:08:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-02-06 10:08:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:08:27,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:27,183 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] [2025-02-06 10:08:27,192 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:08:27,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:27,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:27,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash -266479482, now seen corresponding path program 1 times [2025-02-06 10:08:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:27,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-02-06 10:08:27,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:27,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:08:27,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:08:27,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:27,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:27,548 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:08:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976069738] [2025-02-06 10:08:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976069738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450227743] [2025-02-06 10:08:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:27,553 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:08:27,558 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:08:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:08:27,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:08:27,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:27,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:27,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:08:27,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:27,733 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:08:27,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:27,832 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:08:27,852 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:08:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450227743] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:27,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 10:08:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533311259] [2025-02-06 10:08:27,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:08:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:27,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:08:27,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:08:27,854 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 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:08:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:28,008 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2025-02-06 10:08:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:08:28,008 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 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 31 [2025-02-06 10:08:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:28,009 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:08:28,010 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:08:28,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:08:28,010 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:28,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:08:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2025-02-06 10:08:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.203125) internal successors, (77), 66 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:08:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-02-06 10:08:28,014 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 31 [2025-02-06 10:08:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:28,014 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-02-06 10:08:28,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.625) internal successors, (74), 17 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:08:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-02-06 10:08:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:08:28,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:28,015 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-06 10:08:28,021 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:08:28,219 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,SelfDestructingSolverStorable26 [2025-02-06 10:08:28,219 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:28,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1207401661, now seen corresponding path program 1 times [2025-02-06 10:08:28,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:28,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-02-06 10:08:28,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:28,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:08:28,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:08:28,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:28,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465794447] [2025-02-06 10:08:28,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465794447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180950138] [2025-02-06 10:08:28,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:28,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:28,368 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:08:28,369 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:08:28,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:08:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:08:28,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:28,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:28,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:08:28,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:28,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:28,650 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:08:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:28,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180950138] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:28,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:28,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-06 10:08:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824550363] [2025-02-06 10:08:28,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:28,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:08:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:28,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:08:28,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:08:28,672 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 20 states, 19 states have (on average 4.0) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:28,837 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-02-06 10:08:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:08:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.0) internal successors, (76), 20 states have internal predecessors, (76), 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 33 [2025-02-06 10:08:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:28,838 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:08:28,838 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:08:28,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:08:28,840 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:28,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 179 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:08:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2025-02-06 10:08:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-02-06 10:08:28,842 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 33 [2025-02-06 10:08:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:28,843 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-02-06 10:08:28,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.0) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-02-06 10:08:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:08:28,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:28,843 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 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] [2025-02-06 10:08:28,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:08:29,043 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,SelfDestructingSolverStorable27 [2025-02-06 10:08:29,044 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:29,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1381243553, now seen corresponding path program 2 times [2025-02-06 10:08:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-02-06 10:08:29,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:29,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:08:29,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:08:29,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:29,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796527898] [2025-02-06 10:08:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796527898] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391316483] [2025-02-06 10:08:29,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:29,471 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:08:29,472 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:08:29,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:08:29,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:08:29,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:29,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:29,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:08:29,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:29,613 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:08:29,869 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 16 treesize of output 8 [2025-02-06 10:08:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:29,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:29,965 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 20 treesize of output 12 [2025-02-06 10:08:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 10:08:30,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:30,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 23 [2025-02-06 10:08:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391316483] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:30,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:30,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 37 [2025-02-06 10:08:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738902875] [2025-02-06 10:08:30,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:30,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:08:30,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:30,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:08:30,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:08:30,196 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:30,602 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-02-06 10:08:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:08:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 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:08:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:30,603 INFO L225 Difference]: With dead ends: 106 [2025-02-06 10:08:30,603 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 10:08:30,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1901, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:08:30,604 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:30,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 392 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 10:08:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2025-02-06 10:08:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2025-02-06 10:08:30,610 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 37 [2025-02-06 10:08:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2025-02-06 10:08:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2025-02-06 10:08:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:08:30,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:30,611 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-06 10:08:30,617 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:08:30,811 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,SelfDestructingSolverStorable28 [2025-02-06 10:08:30,811 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:30,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1866352709, now seen corresponding path program 1 times [2025-02-06 10:08:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376844462] [2025-02-06 10:08:30,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:30,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:08:30,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:08:30,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:30,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376844462] [2025-02-06 10:08:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376844462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238420786] [2025-02-06 10:08:30,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:30,964 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:08:30,965 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:08:31,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:08:31,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:08:31,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:31,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:31,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:08:31,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:31,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:31,267 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:08:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238420786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:31,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-02-06 10:08:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121043263] [2025-02-06 10:08:31,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:08:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:31,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:08:31,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:08:31,293 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:31,481 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2025-02-06 10:08:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:08:31,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:08:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:31,482 INFO L225 Difference]: With dead ends: 127 [2025-02-06 10:08:31,482 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 10:08:31,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:08:31,483 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 72 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:31,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 207 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 10:08:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2025-02-06 10:08:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 99 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2025-02-06 10:08:31,487 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 38 [2025-02-06 10:08:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:31,488 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2025-02-06 10:08:31,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2025-02-06 10:08:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:08:31,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:31,488 INFO L218 NwaCegarLoop]: trace histogram [3, 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:08:31,494 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:08:31,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:31,689 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:31,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash 896408219, now seen corresponding path program 3 times [2025-02-06 10:08:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142232689] [2025-02-06 10:08:31,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:31,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-02-06 10:08:31,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:08:31,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:31,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142232689] [2025-02-06 10:08:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142232689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092433333] [2025-02-06 10:08:31,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:31,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:31,916 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:08:31,916 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:08:31,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-02-06 10:08:31,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:08:31,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:31,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:31,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:08:31,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:32,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:32,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:32,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 10:08:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:32,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:32,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-02-06 10:08:32,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:08:32,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-06 10:08:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:32,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092433333] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:32,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2025-02-06 10:08:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765130627] [2025-02-06 10:08:32,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:32,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:08:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:32,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:08:32,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:08:32,799 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:34,303 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2025-02-06 10:08:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:08:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 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 40 [2025-02-06 10:08:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:34,304 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:08:34,304 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 10:08:34,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=337, Invalid=2213, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:08:34,305 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 177 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:34,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 290 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 10:08:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 149. [2025-02-06 10:08:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 146 states have (on average 1.143835616438356) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2025-02-06 10:08:34,315 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 40 [2025-02-06 10:08:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2025-02-06 10:08:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2025-02-06 10:08:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:08:34,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:34,316 INFO L218 NwaCegarLoop]: trace histogram [3, 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:08:34,322 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:08:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:34,521 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:08:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 740200245, now seen corresponding path program 2 times [2025-02-06 10:08:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884978924] [2025-02-06 10:08:34,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:34,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 10:08:34,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:08:34,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:34,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884978924] [2025-02-06 10:08:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884978924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448558567] [2025-02-06 10:08:34,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:34,798 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:08:34,800 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:08:34,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 10:08:34,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:08:34,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:34,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:08:34,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:34,954 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 11 treesize of output 7 [2025-02-06 10:08:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:35,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:35,077 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:08:35,079 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:08:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448558567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:35,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-02-06 10:08:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774395] [2025-02-06 10:08:35,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:08:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:35,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:08:35,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:08:35,135 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 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:08:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:35,267 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2025-02-06 10:08:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:08:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 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) Word has length 44 [2025-02-06 10:08:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:35,268 INFO L225 Difference]: With dead ends: 175 [2025-02-06 10:08:35,268 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:08:35,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:08:35,269 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:35,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 412 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:08:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-02-06 10:08:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 119 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2025-02-06 10:08:35,272 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 44 [2025-02-06 10:08:35,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:35,272 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2025-02-06 10:08:35,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 25 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:08:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2025-02-06 10:08:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:08:35,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:35,273 INFO L218 NwaCegarLoop]: trace histogram [3, 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:08:35,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:35,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:35,477 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:35,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1121108359, now seen corresponding path program 3 times [2025-02-06 10:08:35,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:35,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347111961] [2025-02-06 10:08:35,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:35,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-02-06 10:08:35,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:08:35,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:35,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:08:35,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347111961] [2025-02-06 10:08:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347111961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624708347] [2025-02-06 10:08:35,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:35,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:35,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:35,687 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:08:35,689 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:08:35,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 3 equivalence classes. [2025-02-06 10:08:35,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:08:35,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:35,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:35,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:08:35,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:36,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:36,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:08:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624708347] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:36,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2025-02-06 10:08:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451872810] [2025-02-06 10:08:36,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:08:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:08:36,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:08:36,333 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 32 states, 31 states have (on average 4.290322580645161) internal successors, (133), 32 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:36,544 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2025-02-06 10:08:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:08:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.290322580645161) internal successors, (133), 32 states have internal predecessors, (133), 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:08:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:36,545 INFO L225 Difference]: With dead ends: 212 [2025-02-06 10:08:36,545 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 10:08:36,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:08:36,545 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 85 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:36,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 177 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 10:08:36,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 164. [2025-02-06 10:08:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 161 states have (on average 1.1428571428571428) internal successors, (184), 163 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:36,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2025-02-06 10:08:36,549 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 47 [2025-02-06 10:08:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:36,549 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2025-02-06 10:08:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.290322580645161) internal successors, (133), 32 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2025-02-06 10:08:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:08:36,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:36,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:08:36,560 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:08:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:36,754 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:36,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:36,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1245898116, now seen corresponding path program 2 times [2025-02-06 10:08:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-02-06 10:08:36,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:36,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 10:08:36,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:08:36,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:36,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138703699] [2025-02-06 10:08:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138703699] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16424824] [2025-02-06 10:08:36,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:36,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:36,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:36,933 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:08:36,935 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:08:36,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-06 10:08:37,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 10:08:37,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:37,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:08:37,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:37,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:37,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:08:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16424824] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:37,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:37,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-02-06 10:08:37,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391311532] [2025-02-06 10:08:37,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:37,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:08:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:37,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:08:37,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:08:37,401 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:37,668 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2025-02-06 10:08:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:08:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 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:08:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:37,669 INFO L225 Difference]: With dead ends: 178 [2025-02-06 10:08:37,669 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 10:08:37,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:08:37,670 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 62 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:37,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 338 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 10:08:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2025-02-06 10:08:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 165 states have (on average 1.1393939393939394) internal successors, (188), 167 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2025-02-06 10:08:37,672 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 47 [2025-02-06 10:08:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:37,672 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2025-02-06 10:08:37,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.782608695652174) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2025-02-06 10:08:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:08:37,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:37,674 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:37,681 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:08:37,875 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,SelfDestructingSolverStorable33 [2025-02-06 10:08:37,875 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:37,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:37,875 INFO L85 PathProgramCache]: Analyzing trace with hash 73414680, now seen corresponding path program 4 times [2025-02-06 10:08:37,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:37,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-02-06 10:08:37,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:37,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:37,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-06 10:08:37,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 51 statements. [2025-02-06 10:08:37,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:37,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-02-06 10:08:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790861972] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481112241] [2025-02-06 10:08:38,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:38,332 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:38,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:08:38,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-06 10:08:38,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 51 statements. [2025-02-06 10:08:38,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:38,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:38,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:08:38,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:38,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:38,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:38,814 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:08:38,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:38,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-02-06 10:08:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481112241] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:38,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-02-06 10:08:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22327988] [2025-02-06 10:08:38,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:08:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:08:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:08:38,926 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:39,348 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2025-02-06 10:08:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:08:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 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 51 [2025-02-06 10:08:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:39,349 INFO L225 Difference]: With dead ends: 275 [2025-02-06 10:08:39,349 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 10:08:39,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=2379, Unknown=0, NotChecked=0, Total=2756 [2025-02-06 10:08:39,350 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 69 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 325 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 10:08:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2025-02-06 10:08:39,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 251 states have (on average 1.1314741035856575) internal successors, (284), 253 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 284 transitions. [2025-02-06 10:08:39,353 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 284 transitions. Word has length 51 [2025-02-06 10:08:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:39,353 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 284 transitions. [2025-02-06 10:08:39,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 34 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 284 transitions. [2025-02-06 10:08:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:08:39,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:39,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-06 10:08:39,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 10:08:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:39,558 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -494278992, now seen corresponding path program 1 times [2025-02-06 10:08:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729907450] [2025-02-06 10:08:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:39,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:08:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:08:39,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:39,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729907450] [2025-02-06 10:08:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729907450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033061392] [2025-02-06 10:08:39,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:08:39,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:39,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:39,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:08:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:08:39,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:08:39,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:08:39,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:39,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:08:39,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:39,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:40,063 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:08:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033061392] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:40,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:40,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2025-02-06 10:08:40,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404410376] [2025-02-06 10:08:40,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:08:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:40,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:08:40,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:08:40,095 INFO L87 Difference]: Start difference. First operand 254 states and 284 transitions. Second operand has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 22 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:40,301 INFO L93 Difference]: Finished difference Result 268 states and 292 transitions. [2025-02-06 10:08:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:08:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 22 states have internal predecessors, (110), 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 52 [2025-02-06 10:08:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:40,303 INFO L225 Difference]: With dead ends: 268 [2025-02-06 10:08:40,303 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 10:08:40,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:08:40,303 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:40,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 273 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:08:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 10:08:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 254. [2025-02-06 10:08:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 251 states have (on average 1.1235059760956174) internal successors, (282), 253 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 282 transitions. [2025-02-06 10:08:40,307 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 282 transitions. Word has length 52 [2025-02-06 10:08:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 282 transitions. [2025-02-06 10:08:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 22 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 282 transitions. [2025-02-06 10:08:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:08:40,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:40,307 INFO L218 NwaCegarLoop]: trace histogram [4, 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:08:40,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:40,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:40,508 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:40,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1239498706, now seen corresponding path program 5 times [2025-02-06 10:08:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:40,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-02-06 10:08:40,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:40,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 4 equivalence classes. [2025-02-06 10:08:40,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:08:40,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:08:40,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141282132] [2025-02-06 10:08:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141282132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776850349] [2025-02-06 10:08:40,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:40,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:40,666 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:40,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:08:40,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 4 equivalence classes. [2025-02-06 10:08:40,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:08:40,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:08:40,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:40,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:08:40,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:40,760 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:08:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:40,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776850349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:41,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-02-06 10:08:41,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378621392] [2025-02-06 10:08:41,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:41,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:08:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:41,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:08:41,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:08:41,231 INFO L87 Difference]: Start difference. First operand 254 states and 282 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:41,588 INFO L93 Difference]: Finished difference Result 383 states and 423 transitions. [2025-02-06 10:08:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:08:41,589 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 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 54 [2025-02-06 10:08:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:41,590 INFO L225 Difference]: With dead ends: 383 [2025-02-06 10:08:41,590 INFO L226 Difference]: Without dead ends: 383 [2025-02-06 10:08:41,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:08:41,590 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 90 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:41,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 606 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:08:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-06 10:08:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 274. [2025-02-06 10:08:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 271 states have (on average 1.132841328413284) internal successors, (307), 273 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 307 transitions. [2025-02-06 10:08:41,596 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 307 transitions. Word has length 54 [2025-02-06 10:08:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 307 transitions. [2025-02-06 10:08:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 307 transitions. [2025-02-06 10:08:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 10:08:41,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:41,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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:08:41,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 10:08:41,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 10:08:41,798 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:41,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -190187859, now seen corresponding path program 3 times [2025-02-06 10:08:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:41,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237991203] [2025-02-06 10:08:41,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:41,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-02-06 10:08:41,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:08:41,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:08:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237991203] [2025-02-06 10:08:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237991203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357200345] [2025-02-06 10:08:42,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:42,303 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:42,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:08:42,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-02-06 10:08:42,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 10:08:42,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:08:42,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:42,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 10:08:42,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:42,592 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 15 treesize of output 1 [2025-02-06 10:08:42,634 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:08:42,663 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:08:43,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:08:43,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:43,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 11 [2025-02-06 10:08:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:08:43,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:43,393 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 22 treesize of output 20 [2025-02-06 10:08:43,395 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 34 treesize of output 30 [2025-02-06 10:08:43,433 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 20 treesize of output 18 [2025-02-06 10:08:43,434 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 38 treesize of output 34 [2025-02-06 10:08:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:43,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357200345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:43,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:43,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 21] total 55 [2025-02-06 10:08:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815765748] [2025-02-06 10:08:43,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:43,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:08:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:43,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:08:43,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2765, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:08:43,596 INFO L87 Difference]: Start difference. First operand 274 states and 307 transitions. Second operand has 55 states, 55 states have (on average 2.5636363636363635) internal successors, (141), 55 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:45,299 INFO L93 Difference]: Finished difference Result 412 states and 457 transitions. [2025-02-06 10:08:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 10:08:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.5636363636363635) internal successors, (141), 55 states have internal predecessors, (141), 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 58 [2025-02-06 10:08:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:45,300 INFO L225 Difference]: With dead ends: 412 [2025-02-06 10:08:45,300 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 10:08:45,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=584, Invalid=6898, Unknown=0, NotChecked=0, Total=7482 [2025-02-06 10:08:45,302 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 167 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:45,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 951 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:08:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 10:08:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 317. [2025-02-06 10:08:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 314 states have (on average 1.1337579617834395) internal successors, (356), 316 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 356 transitions. [2025-02-06 10:08:45,310 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 356 transitions. Word has length 58 [2025-02-06 10:08:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 356 transitions. [2025-02-06 10:08:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.5636363636363635) internal successors, (141), 55 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 356 transitions. [2025-02-06 10:08:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:08:45,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:45,314 INFO L218 NwaCegarLoop]: trace histogram [4, 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:08:45,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:08:45,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 10:08:45,515 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:45,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash 897690658, now seen corresponding path program 4 times [2025-02-06 10:08:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-02-06 10:08:45,515 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:45,521 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-02-06 10:08:45,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 60 statements. [2025-02-06 10:08:45,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:08:45,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-02-06 10:08:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121701438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494455260] [2025-02-06 10:08:45,966 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:45,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:45,968 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:45,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:08:46,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-02-06 10:08:46,066 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 60 statements. [2025-02-06 10:08:46,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:46,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:46,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 10:08:46,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:46,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:47,713 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2025-02-06 10:08:47,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2025-02-06 10:08:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:08:47,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:48,160 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:08:48,167 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:08:48,176 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:08:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 10:08:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494455260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:48,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:48,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 35 [2025-02-06 10:08:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449705537] [2025-02-06 10:08:48,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:08:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:48,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:08:48,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1010, Unknown=2, NotChecked=0, Total=1260 [2025-02-06 10:08:48,189 INFO L87 Difference]: Start difference. First operand 317 states and 356 transitions. Second operand has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:48,750 INFO L93 Difference]: Finished difference Result 405 states and 446 transitions. [2025-02-06 10:08:48,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:08:48,750 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 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 60 [2025-02-06 10:08:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:48,751 INFO L225 Difference]: With dead ends: 405 [2025-02-06 10:08:48,751 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 10:08:48,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=397, Invalid=1323, Unknown=2, NotChecked=0, Total=1722 [2025-02-06 10:08:48,752 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:48,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 356 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:08:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 10:08:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 242. [2025-02-06 10:08:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 240 states have (on average 1.125) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2025-02-06 10:08:48,756 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 60 [2025-02-06 10:08:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:48,756 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2025-02-06 10:08:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 36 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2025-02-06 10:08:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 10:08:48,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:48,757 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:48,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:48,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-06 10:08:48,957 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1898094321, now seen corresponding path program 4 times [2025-02-06 10:08:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:48,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-02-06 10:08:48,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:48,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:08:48,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 61 statements. [2025-02-06 10:08:48,980 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:48,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:49,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188791365] [2025-02-06 10:08:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188791365] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:49,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65155387] [2025-02-06 10:08:49,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:49,591 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:49,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:08:49,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:08:49,671 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 53 of 61 statements. [2025-02-06 10:08:49,671 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:49,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:49,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 10:08:49,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:49,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:08:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:50,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:50,397 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 59 treesize of output 51 [2025-02-06 10:08:50,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:08:50,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 45 [2025-02-06 10:08:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65155387] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:50,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 49 [2025-02-06 10:08:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481166122] [2025-02-06 10:08:50,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:50,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:08:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:50,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:08:50,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2062, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:08:50,627 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:51,530 INFO L93 Difference]: Finished difference Result 383 states and 421 transitions. [2025-02-06 10:08:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:08:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 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 61 [2025-02-06 10:08:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:51,532 INFO L225 Difference]: With dead ends: 383 [2025-02-06 10:08:51,532 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 10:08:51,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=609, Invalid=4503, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 10:08:51,534 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:51,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 560 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:08:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 10:08:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 326. [2025-02-06 10:08:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 324 states have (on average 1.1203703703703705) internal successors, (363), 325 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 363 transitions. [2025-02-06 10:08:51,541 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 363 transitions. Word has length 61 [2025-02-06 10:08:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:51,541 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 363 transitions. [2025-02-06 10:08:51,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 363 transitions. [2025-02-06 10:08:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 10:08:51,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:51,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:08:51,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:08:51,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-06 10:08:51,743 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:51,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:51,743 INFO L85 PathProgramCache]: Analyzing trace with hash 218217901, now seen corresponding path program 2 times [2025-02-06 10:08:51,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:51,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002547990] [2025-02-06 10:08:51,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:51,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:51,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:08:51,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:08:51,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:51,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002547990] [2025-02-06 10:08:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002547990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684471323] [2025-02-06 10:08:52,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:08:52,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:52,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:52,086 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:52,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:08:52,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 10:08:52,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 10:08:52,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:08:52,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:52,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:08:52,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:52,364 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:08:52,525 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 16 treesize of output 8 [2025-02-06 10:08:52,548 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 7 treesize of output 3 [2025-02-06 10:08:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:52,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:52,597 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 20 treesize of output 12 [2025-02-06 10:08:52,623 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:08:52,626 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:08:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:08:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684471323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:52,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 32 [2025-02-06 10:08:52,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160882932] [2025-02-06 10:08:52,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:52,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:08:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:52,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:08:52,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:08:52,674 INFO L87 Difference]: Start difference. First operand 326 states and 363 transitions. Second operand has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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:08:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:53,017 INFO L93 Difference]: Finished difference Result 467 states and 512 transitions. [2025-02-06 10:08:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:08:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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 63 [2025-02-06 10:08:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:53,018 INFO L225 Difference]: With dead ends: 467 [2025-02-06 10:08:53,018 INFO L226 Difference]: Without dead ends: 467 [2025-02-06 10:08:53,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:08:53,019 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:53,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 605 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:08:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-02-06 10:08:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 396. [2025-02-06 10:08:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 394 states have (on average 1.1091370558375635) internal successors, (437), 395 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 437 transitions. [2025-02-06 10:08:53,024 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 437 transitions. Word has length 63 [2025-02-06 10:08:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:53,025 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 437 transitions. [2025-02-06 10:08:53,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 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:08:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 437 transitions. [2025-02-06 10:08:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 10:08:53,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:53,025 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:53,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 10:08:53,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:53,230 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 719514351, now seen corresponding path program 5 times [2025-02-06 10:08:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161123892] [2025-02-06 10:08:53,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:53,238 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 5 equivalence classes. [2025-02-06 10:08:53,254 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:08:53,254 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 10:08:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:08:53,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161123892] [2025-02-06 10:08:53,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161123892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71300297] [2025-02-06 10:08:53,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:08:53,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:53,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:53,449 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:53,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:08:53,523 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 64 statements into 5 equivalence classes. [2025-02-06 10:08:53,562 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 10:08:53,562 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 10:08:53,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:53,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:08:53,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:08:53,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:53,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-02-06 10:08:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:08:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71300297] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:53,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-02-06 10:08:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172596956] [2025-02-06 10:08:53,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:53,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 10:08:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:53,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 10:08:53,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:08:53,985 INFO L87 Difference]: Start difference. First operand 396 states and 437 transitions. Second operand has 29 states, 28 states have (on average 4.75) internal successors, (133), 29 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:54,309 INFO L93 Difference]: Finished difference Result 452 states and 495 transitions. [2025-02-06 10:08:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:08:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.75) internal successors, (133), 29 states have internal predecessors, (133), 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 64 [2025-02-06 10:08:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:54,310 INFO L225 Difference]: With dead ends: 452 [2025-02-06 10:08:54,310 INFO L226 Difference]: Without dead ends: 452 [2025-02-06 10:08:54,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:08:54,311 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:54,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 752 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:08:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-06 10:08:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 400. [2025-02-06 10:08:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 398 states have (on average 1.1080402010050252) internal successors, (441), 399 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 441 transitions. [2025-02-06 10:08:54,315 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 441 transitions. Word has length 64 [2025-02-06 10:08:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:54,315 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 441 transitions. [2025-02-06 10:08:54,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.75) internal successors, (133), 29 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 441 transitions. [2025-02-06 10:08:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:08:54,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:54,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:54,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:08:54,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:54,520 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:54,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1774411803, now seen corresponding path program 3 times [2025-02-06 10:08:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406913021] [2025-02-06 10:08:54,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:54,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 3 equivalence classes. [2025-02-06 10:08:54,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:08:54,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:54,923 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406913021] [2025-02-06 10:08:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406913021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467800404] [2025-02-06 10:08:54,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:08:54,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:54,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:54,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:08:55,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 3 equivalence classes. [2025-02-06 10:08:55,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:08:55,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:08:55,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:55,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 10:08:55,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:55,188 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 11 treesize of output 7 [2025-02-06 10:08:55,210 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 8 treesize of output 1 [2025-02-06 10:08:55,586 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 16 treesize of output 8 [2025-02-06 10:08:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:55,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:08:55,876 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 18 treesize of output 14 [2025-02-06 10:08:55,899 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:08:55,901 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:08:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:08:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467800404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:08:56,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:08:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 49 [2025-02-06 10:08:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284320296] [2025-02-06 10:08:56,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:08:56,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:08:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:08:56,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:08:56,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:08:56,026 INFO L87 Difference]: Start difference. First operand 400 states and 441 transitions. Second operand has 49 states, 49 states have (on average 3.2857142857142856) internal successors, (161), 49 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:08:56,570 INFO L93 Difference]: Finished difference Result 507 states and 552 transitions. [2025-02-06 10:08:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:08:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.2857142857142856) internal successors, (161), 49 states have internal predecessors, (161), 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 65 [2025-02-06 10:08:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:08:56,572 INFO L225 Difference]: With dead ends: 507 [2025-02-06 10:08:56,572 INFO L226 Difference]: Without dead ends: 507 [2025-02-06 10:08:56,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=2819, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 10:08:56,572 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:08:56,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 772 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:08:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-06 10:08:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 484. [2025-02-06 10:08:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 482 states have (on average 1.0975103734439835) internal successors, (529), 483 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 529 transitions. [2025-02-06 10:08:56,578 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 529 transitions. Word has length 65 [2025-02-06 10:08:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:08:56,581 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 529 transitions. [2025-02-06 10:08:56,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.2857142857142856) internal successors, (161), 49 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:08:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 529 transitions. [2025-02-06 10:08:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:08:56,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:08:56,582 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:08:56,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 10:08:56,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:56,783 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:08:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:08:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1111777303, now seen corresponding path program 4 times [2025-02-06 10:08:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:08:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774197126] [2025-02-06 10:08:56,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:08:56,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-06 10:08:56,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 66 statements. [2025-02-06 10:08:56,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:56,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:08:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:08:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774197126] [2025-02-06 10:08:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774197126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:08:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223291006] [2025-02-06 10:08:57,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:08:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:08:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:08:57,537 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:08:57,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:08:57,618 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-02-06 10:08:57,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 66 statements. [2025-02-06 10:08:57,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:08:57,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:08:57,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:08:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:08:57,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:09:02,670 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 16 treesize of output 8 [2025-02-06 10:09:02,742 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 10:09:02,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 31 [2025-02-06 10:09:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 42 refuted. 3 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:09:02,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:03,149 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 20 treesize of output 12 [2025-02-06 10:09:03,631 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:09:03,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 10:09:03,641 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 44 treesize of output 34 [2025-02-06 10:09:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:09:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223291006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:03,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 51 [2025-02-06 10:09:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143311836] [2025-02-06 10:09:03,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 10:09:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 10:09:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2406, Unknown=2, NotChecked=0, Total=2652 [2025-02-06 10:09:03,674 INFO L87 Difference]: Start difference. First operand 484 states and 529 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:06,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:09:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:11,629 INFO L93 Difference]: Finished difference Result 685 states and 740 transitions. [2025-02-06 10:09:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-06 10:09:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 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 66 [2025-02-06 10:09:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:11,630 INFO L225 Difference]: With dead ends: 685 [2025-02-06 10:09:11,630 INFO L226 Difference]: Without dead ends: 685 [2025-02-06 10:09:11,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1409, Invalid=9095, Unknown=2, NotChecked=0, Total=10506 [2025-02-06 10:09:11,632 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 445 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 23 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 520 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1340 Invalid, 10 Unknown, 0 Unchecked, 5.2s Time] [2025-02-06 10:09:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-06 10:09:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 587. [2025-02-06 10:09:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 585 states have (on average 1.0991452991452992) internal successors, (643), 586 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 643 transitions. [2025-02-06 10:09:11,638 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 643 transitions. Word has length 66 [2025-02-06 10:09:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 643 transitions. [2025-02-06 10:09:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 643 transitions. [2025-02-06 10:09:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 10:09:11,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:11,639 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:11,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-06 10:09:11,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-06 10:09:11,840 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:11,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -663578869, now seen corresponding path program 6 times [2025-02-06 10:09:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:11,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332822079] [2025-02-06 10:09:11,841 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:11,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 5 equivalence classes. [2025-02-06 10:09:11,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:09:11,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:09:11,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 5 proven. 73 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:09:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332822079] [2025-02-06 10:09:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332822079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914993192] [2025-02-06 10:09:12,126 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:12,128 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:12,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:09:12,207 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 5 equivalence classes. [2025-02-06 10:09:12,258 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 10:09:12,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:09:12,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:12,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:09:12,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:12,272 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:09:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:09:12,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:09:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914993192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:12,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:12,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2025-02-06 10:09:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670700691] [2025-02-06 10:09:12,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:12,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:09:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:12,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:09:12,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:09:12,730 INFO L87 Difference]: Start difference. First operand 587 states and 643 transitions. Second operand has 37 states, 36 states have (on average 4.111111111111111) internal successors, (148), 37 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:13,074 INFO L93 Difference]: Finished difference Result 800 states and 872 transitions. [2025-02-06 10:09:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:09:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.111111111111111) internal successors, (148), 37 states have internal predecessors, (148), 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 68 [2025-02-06 10:09:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:13,075 INFO L225 Difference]: With dead ends: 800 [2025-02-06 10:09:13,076 INFO L226 Difference]: Without dead ends: 800 [2025-02-06 10:09:13,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=1625, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:09:13,076 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 131 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:13,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 451 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:09:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-06 10:09:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 603. [2025-02-06 10:09:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 601 states have (on average 1.103161397670549) internal successors, (663), 602 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 663 transitions. [2025-02-06 10:09:13,083 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 663 transitions. Word has length 68 [2025-02-06 10:09:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 663 transitions. [2025-02-06 10:09:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.111111111111111) internal successors, (148), 37 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 663 transitions. [2025-02-06 10:09:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 10:09:13,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:13,084 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:13,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-06 10:09:13,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-02-06 10:09:13,284 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1613035162, now seen corresponding path program 6 times [2025-02-06 10:09:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397505656] [2025-02-06 10:09:13,285 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:13,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 5 equivalence classes. [2025-02-06 10:09:13,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:09:13,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:09:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:09:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397505656] [2025-02-06 10:09:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397505656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937962197] [2025-02-06 10:09:13,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:13,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:13,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:13,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:09:13,754 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 72 statements into 5 equivalence classes. [2025-02-06 10:09:13,823 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 10:09:13,823 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:09:13,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:13,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:09:13,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:13,926 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:09:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:09:14,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:14,185 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:09:14,186 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:09:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 86 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:09:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937962197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:14,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 37 [2025-02-06 10:09:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328417688] [2025-02-06 10:09:14,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:14,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:09:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:09:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1249, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:09:14,252 INFO L87 Difference]: Start difference. First operand 603 states and 663 transitions. Second operand has 37 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 37 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:09:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:16,156 INFO L93 Difference]: Finished difference Result 1235 states and 1344 transitions. [2025-02-06 10:09:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-02-06 10:09:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 37 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) Word has length 72 [2025-02-06 10:09:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:16,159 INFO L225 Difference]: With dead ends: 1235 [2025-02-06 10:09:16,159 INFO L226 Difference]: Without dead ends: 1223 [2025-02-06 10:09:16,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=453, Invalid=6857, Unknown=0, NotChecked=0, Total=7310 [2025-02-06 10:09:16,160 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 160 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:16,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 2333 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 10:09:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-06 10:09:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 867. [2025-02-06 10:09:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 865 states have (on average 1.1028901734104046) internal successors, (954), 866 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 954 transitions. [2025-02-06 10:09:16,169 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 954 transitions. Word has length 72 [2025-02-06 10:09:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:16,169 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 954 transitions. [2025-02-06 10:09:16,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.4324324324324325) internal successors, (127), 37 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:09:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 954 transitions. [2025-02-06 10:09:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 10:09:16,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:16,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:16,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-06 10:09:16,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-02-06 10:09:16,372 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:16,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash -43432752, now seen corresponding path program 5 times [2025-02-06 10:09:16,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:16,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911555156] [2025-02-06 10:09:16,374 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:09:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:16,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 4 equivalence classes. [2025-02-06 10:09:16,389 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:09:16,389 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:09:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:16,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911555156] [2025-02-06 10:09:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911555156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:16,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583361054] [2025-02-06 10:09:16,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:09:16,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:16,922 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:16,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-06 10:09:17,006 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 78 statements into 4 equivalence classes. [2025-02-06 10:09:17,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:09:17,041 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:09:17,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:17,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:09:17,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:17,134 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:09:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 57 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:09:17,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:17,268 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:09:17,269 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:09:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 57 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:09:17,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583361054] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:17,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:17,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 28 [2025-02-06 10:09:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63050095] [2025-02-06 10:09:17,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:17,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:09:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:17,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:09:17,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:09:17,346 INFO L87 Difference]: Start difference. First operand 867 states and 954 transitions. Second operand has 28 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:17,814 INFO L93 Difference]: Finished difference Result 855 states and 938 transitions. [2025-02-06 10:09:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:09:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 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 78 [2025-02-06 10:09:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:17,816 INFO L225 Difference]: With dead ends: 855 [2025-02-06 10:09:17,816 INFO L226 Difference]: Without dead ends: 616 [2025-02-06 10:09:17,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:09:17,817 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:17,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 526 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:09:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-06 10:09:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2025-02-06 10:09:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.1160130718954249) internal successors, (683), 613 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 683 transitions. [2025-02-06 10:09:17,823 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 683 transitions. Word has length 78 [2025-02-06 10:09:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 683 transitions. [2025-02-06 10:09:17,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.928571428571429) internal successors, (138), 28 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 683 transitions. [2025-02-06 10:09:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-06 10:09:17,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:17,824 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:17,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-06 10:09:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-02-06 10:09:18,024 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -243508508, now seen corresponding path program 7 times [2025-02-06 10:09:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964573291] [2025-02-06 10:09:18,025 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:18,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 10:09:18,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:09:18,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:18,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 5 proven. 89 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964573291] [2025-02-06 10:09:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964573291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:18,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069118098] [2025-02-06 10:09:18,279 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:18,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:18,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:18,281 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:18,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-06 10:09:18,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 10:09:18,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 10:09:18,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:18,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:18,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:09:18,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:18,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:18,754 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:09:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 82 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069118098] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:18,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 30 [2025-02-06 10:09:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408965755] [2025-02-06 10:09:18,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:18,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:09:18,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:18,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:09:18,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:09:18,814 INFO L87 Difference]: Start difference. First operand 614 states and 683 transitions. Second operand has 31 states, 30 states have (on average 4.733333333333333) internal successors, (142), 31 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:19,184 INFO L93 Difference]: Finished difference Result 752 states and 828 transitions. [2025-02-06 10:09:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:09:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.733333333333333) internal successors, (142), 31 states have internal predecessors, (142), 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 78 [2025-02-06 10:09:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:19,186 INFO L225 Difference]: With dead ends: 752 [2025-02-06 10:09:19,186 INFO L226 Difference]: Without dead ends: 752 [2025-02-06 10:09:19,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:09:19,187 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 153 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:19,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 717 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:09:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-02-06 10:09:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 618. [2025-02-06 10:09:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 616 states have (on average 1.1152597402597402) internal successors, (687), 617 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 687 transitions. [2025-02-06 10:09:19,193 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 687 transitions. Word has length 78 [2025-02-06 10:09:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:19,193 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 687 transitions. [2025-02-06 10:09:19,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.733333333333333) internal successors, (142), 31 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 687 transitions. [2025-02-06 10:09:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 10:09:19,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:19,194 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:19,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-02-06 10:09:19,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-02-06 10:09:19,395 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:19,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1201611540, now seen corresponding path program 6 times [2025-02-06 10:09:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-02-06 10:09:19,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:19,403 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 4 equivalence classes. [2025-02-06 10:09:19,415 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 10:09:19,415 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 10:09:19,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:19,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:19,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100441662] [2025-02-06 10:09:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100441662] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:19,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719533209] [2025-02-06 10:09:19,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:09:19,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:19,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:19,863 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:19,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-06 10:09:19,965 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 81 statements into 4 equivalence classes. [2025-02-06 10:09:20,008 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 10:09:20,008 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-06 10:09:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:20,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 10:09:20,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:20,163 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 11 treesize of output 7 [2025-02-06 10:09:20,191 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 8 treesize of output 1 [2025-02-06 10:09:20,575 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 16 treesize of output 8 [2025-02-06 10:09:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:20,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:20,885 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 18 treesize of output 14 [2025-02-06 10:09:20,909 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:09:20,910 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:09:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719533209] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:21,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:21,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 51 [2025-02-06 10:09:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239435651] [2025-02-06 10:09:21,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-06 10:09:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:21,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-06 10:09:21,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2383, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:09:21,043 INFO L87 Difference]: Start difference. First operand 618 states and 687 transitions. Second operand has 51 states, 51 states have (on average 4.098039215686274) internal successors, (209), 51 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:21,924 INFO L93 Difference]: Finished difference Result 1386 states and 1511 transitions. [2025-02-06 10:09:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:09:21,925 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.098039215686274) internal successors, (209), 51 states have internal predecessors, (209), 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 81 [2025-02-06 10:09:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:21,927 INFO L225 Difference]: With dead ends: 1386 [2025-02-06 10:09:21,927 INFO L226 Difference]: Without dead ends: 1386 [2025-02-06 10:09:21,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=3961, Unknown=0, NotChecked=0, Total=4290 [2025-02-06 10:09:21,928 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:21,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1229 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:09:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-02-06 10:09:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1020. [2025-02-06 10:09:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1018 states have (on average 1.1051080550098231) internal successors, (1125), 1019 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1125 transitions. [2025-02-06 10:09:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1125 transitions. Word has length 81 [2025-02-06 10:09:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1125 transitions. [2025-02-06 10:09:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.098039215686274) internal successors, (209), 51 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1125 transitions. [2025-02-06 10:09:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 10:09:21,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:21,940 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:21,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-02-06 10:09:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-06 10:09:22,140 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash -734460800, now seen corresponding path program 7 times [2025-02-06 10:09:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093209830] [2025-02-06 10:09:22,141 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:22,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 10:09:22,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 10:09:22,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:22,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 12 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:09:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093209830] [2025-02-06 10:09:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093209830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:22,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949596196] [2025-02-06 10:09:22,549 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:22,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:22,563 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:22,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-06 10:09:22,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 10:09:22,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 10:09:22,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:22,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:22,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 10:09:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 103 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:09:22,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:23,163 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:09:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 103 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:09:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949596196] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:23,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 35 [2025-02-06 10:09:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276187896] [2025-02-06 10:09:23,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:09:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:09:23,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:09:23,231 INFO L87 Difference]: Start difference. First operand 1020 states and 1125 transitions. Second operand has 36 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:23,788 INFO L93 Difference]: Finished difference Result 1309 states and 1441 transitions. [2025-02-06 10:09:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:09:23,789 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 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 82 [2025-02-06 10:09:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:23,791 INFO L225 Difference]: With dead ends: 1309 [2025-02-06 10:09:23,791 INFO L226 Difference]: Without dead ends: 1309 [2025-02-06 10:09:23,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:09:23,792 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 206 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:23,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 997 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:09:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2025-02-06 10:09:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1056. [2025-02-06 10:09:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1054 states have (on average 1.110056925996205) internal successors, (1170), 1055 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1170 transitions. [2025-02-06 10:09:23,801 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1170 transitions. Word has length 82 [2025-02-06 10:09:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:23,802 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1170 transitions. [2025-02-06 10:09:23,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.428571428571429) internal successors, (155), 36 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1170 transitions. [2025-02-06 10:09:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 10:09:23,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:23,803 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:23,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-02-06 10:09:24,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-02-06 10:09:24,003 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:24,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash 978546256, now seen corresponding path program 7 times [2025-02-06 10:09:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531802382] [2025-02-06 10:09:24,004 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:24,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 10:09:24,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:09:24,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:24,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 5 proven. 113 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531802382] [2025-02-06 10:09:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531802382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642343844] [2025-02-06 10:09:24,254 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:09:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:24,256 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:24,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-06 10:09:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 10:09:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 10:09:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:09:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:24,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:09:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:24,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:24,784 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:09:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 106 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:09:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642343844] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:24,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 29 [2025-02-06 10:09:24,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677830173] [2025-02-06 10:09:24,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:09:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:09:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:09:24,839 INFO L87 Difference]: Start difference. First operand 1056 states and 1170 transitions. Second operand has 30 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:25,360 INFO L93 Difference]: Finished difference Result 1306 states and 1442 transitions. [2025-02-06 10:09:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:09:25,360 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 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 84 [2025-02-06 10:09:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:25,363 INFO L225 Difference]: With dead ends: 1306 [2025-02-06 10:09:25,363 INFO L226 Difference]: Without dead ends: 1306 [2025-02-06 10:09:25,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:09:25,363 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 107 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:25,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 850 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:09:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2025-02-06 10:09:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1180. [2025-02-06 10:09:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1178 states have (on average 1.1103565365025467) internal successors, (1308), 1179 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1308 transitions. [2025-02-06 10:09:25,378 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1308 transitions. Word has length 84 [2025-02-06 10:09:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1308 transitions. [2025-02-06 10:09:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 6.0) internal successors, (174), 30 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1308 transitions. [2025-02-06 10:09:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 10:09:25,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:25,380 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:25,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-02-06 10:09:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:25,580 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1326691419, now seen corresponding path program 8 times [2025-02-06 10:09:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427259571] [2025-02-06 10:09:25,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:09:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:25,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:09:25,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:09:25,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:09:25,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 5 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:09:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427259571] [2025-02-06 10:09:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427259571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357845153] [2025-02-06 10:09:26,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:09:26,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:26,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:26,879 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:26,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-02-06 10:09:26,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:09:27,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:09:27,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:09:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:27,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 10:09:27,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:27,150 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:09:27,426 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 16 treesize of output 8 [2025-02-06 10:09:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 30 proven. 102 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:27,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:27,660 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 20 treesize of output 12 [2025-02-06 10:09:27,695 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:09:27,696 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:09:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 30 proven. 102 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357845153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:27,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 22] total 55 [2025-02-06 10:09:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254429182] [2025-02-06 10:09:27,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:09:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:27,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:09:27,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2813, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:09:27,782 INFO L87 Difference]: Start difference. First operand 1180 states and 1308 transitions. Second operand has 55 states, 55 states have (on average 3.036363636363636) internal successors, (167), 55 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:30,881 INFO L93 Difference]: Finished difference Result 1595 states and 1763 transitions. [2025-02-06 10:09:30,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-02-06 10:09:30,882 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.036363636363636) internal successors, (167), 55 states have internal predecessors, (167), 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 86 [2025-02-06 10:09:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:30,884 INFO L225 Difference]: With dead ends: 1595 [2025-02-06 10:09:30,884 INFO L226 Difference]: Without dead ends: 1595 [2025-02-06 10:09:30,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3499 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=675, Invalid=12665, Unknown=0, NotChecked=0, Total=13340 [2025-02-06 10:09:30,886 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 293 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 4343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:30,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2011 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4343 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 10:09:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-02-06 10:09:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1300. [2025-02-06 10:09:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1298 states have (on average 1.1117103235747303) internal successors, (1443), 1299 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1443 transitions. [2025-02-06 10:09:30,896 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1443 transitions. Word has length 86 [2025-02-06 10:09:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1443 transitions. [2025-02-06 10:09:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.036363636363636) internal successors, (167), 55 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1443 transitions. [2025-02-06 10:09:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 10:09:30,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:30,898 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:30,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-02-06 10:09:31,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:31,099 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:31,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -212880745, now seen corresponding path program 8 times [2025-02-06 10:09:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283900425] [2025-02-06 10:09:31,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:09:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:31,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-06 10:09:31,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:09:31,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:09:31,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 10:09:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283900425] [2025-02-06 10:09:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283900425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010906065] [2025-02-06 10:09:31,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:09:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:31,592 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:31,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-02-06 10:09:31,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-02-06 10:09:31,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 10:09:31,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:09:31,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:31,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:09:31,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:31,829 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:09:32,035 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 16 treesize of output 8 [2025-02-06 10:09:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 10:09:32,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:32,216 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 20 treesize of output 12 [2025-02-06 10:09:32,249 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:09:32,250 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:09:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 56 proven. 63 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 10:09:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010906065] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:32,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 42 [2025-02-06 10:09:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329477335] [2025-02-06 10:09:32,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:32,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:09:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:32,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:09:32,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1614, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:09:32,323 INFO L87 Difference]: Start difference. First operand 1300 states and 1443 transitions. Second operand has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:33,306 INFO L93 Difference]: Finished difference Result 1282 states and 1417 transitions. [2025-02-06 10:09:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:09:33,307 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 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 88 [2025-02-06 10:09:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:33,309 INFO L225 Difference]: With dead ends: 1282 [2025-02-06 10:09:33,309 INFO L226 Difference]: Without dead ends: 1282 [2025-02-06 10:09:33,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=3385, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 10:09:33,310 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:33,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 779 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:09:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2025-02-06 10:09:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1266. [2025-02-06 10:09:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1264 states have (on average 1.1083860759493671) internal successors, (1401), 1265 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1401 transitions. [2025-02-06 10:09:33,319 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1401 transitions. Word has length 88 [2025-02-06 10:09:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1401 transitions. [2025-02-06 10:09:33,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.642857142857143) internal successors, (153), 42 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1401 transitions. [2025-02-06 10:09:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 10:09:33,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:33,321 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:33,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-02-06 10:09:33,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-02-06 10:09:33,521 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2117839409, now seen corresponding path program 9 times [2025-02-06 10:09:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583214705] [2025-02-06 10:09:33,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:09:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:33,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 5 equivalence classes. [2025-02-06 10:09:33,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 87 of 90 statements. [2025-02-06 10:09:33,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:09:33,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:09:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583214705] [2025-02-06 10:09:33,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583214705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240797010] [2025-02-06 10:09:33,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:09:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:33,994 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:33,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-02-06 10:09:34,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 5 equivalence classes. [2025-02-06 10:09:34,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 87 of 90 statements. [2025-02-06 10:09:34,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 10:09:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:34,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:09:34,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:34,294 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:09:34,499 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 16 treesize of output 8 [2025-02-06 10:09:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 56 proven. 71 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:09:34,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:09:34,680 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 20 treesize of output 12 [2025-02-06 10:09:34,716 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:09:34,718 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:09:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 56 proven. 71 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:09:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240797010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:09:34,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:09:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 42 [2025-02-06 10:09:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137167823] [2025-02-06 10:09:34,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:09:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 10:09:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:09:34,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 10:09:34,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1614, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 10:09:34,788 INFO L87 Difference]: Start difference. First operand 1266 states and 1401 transitions. Second operand has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:09:35,783 INFO L93 Difference]: Finished difference Result 1218 states and 1340 transitions. [2025-02-06 10:09:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:09:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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 90 [2025-02-06 10:09:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:09:35,786 INFO L225 Difference]: With dead ends: 1218 [2025-02-06 10:09:35,786 INFO L226 Difference]: Without dead ends: 1218 [2025-02-06 10:09:35,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=3388, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 10:09:35,786 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:09:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 858 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:09:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-02-06 10:09:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1208. [2025-02-06 10:09:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1206 states have (on average 1.1028192371475953) internal successors, (1330), 1207 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1330 transitions. [2025-02-06 10:09:35,795 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1330 transitions. Word has length 90 [2025-02-06 10:09:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:09:35,796 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1330 transitions. [2025-02-06 10:09:35,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:09:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1330 transitions. [2025-02-06 10:09:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 10:09:35,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:09:35,797 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:09:35,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-02-06 10:09:35,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:35,998 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:09:35,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:09:35,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1626895397, now seen corresponding path program 10 times [2025-02-06 10:09:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:09:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426926153] [2025-02-06 10:09:35,998 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:09:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:09:36,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-02-06 10:09:36,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 80 of 91 statements. [2025-02-06 10:09:36,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:09:36,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-06 10:09:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:09:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426926153] [2025-02-06 10:09:37,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426926153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:09:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577743473] [2025-02-06 10:09:37,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:09:37,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:09:37,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:09:37,948 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:09:37,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-02-06 10:09:38,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 91 statements into 2 equivalence classes. [2025-02-06 10:09:38,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 80 of 91 statements. [2025-02-06 10:09:38,080 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:09:38,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:09:38,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 10:09:38,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:09:38,112 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