./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 79a0aa7f506a25068fe5f831c3bf60ccd6ee82a9d4cedb42c580c3cecf620506 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:10:36,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:10:36,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 10:10:36,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:10:36,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:10:36,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:10:36,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:10:36,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:10:36,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:10:36,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:10:36,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:10:36,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:10:36,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:10:36,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:10:36,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:10:36,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:10:36,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:10:36,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:10:36,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:10:36,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:10:36,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:10:36,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:10:36,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:10:36,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:10:36,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 79a0aa7f506a25068fe5f831c3bf60ccd6ee82a9d4cedb42c580c3cecf620506 [2025-02-06 10:10:36,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:10:36,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:10:36,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:10:36,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:10:36,866 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:10:36,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2025-02-06 10:10:38,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c324d2c/dcb84b51416046d7ac4e9407a6eb1da6/FLAG2a6ba4f0e [2025-02-06 10:10:38,471 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:10:38,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/substring-alloca-1.i [2025-02-06 10:10:38,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c324d2c/dcb84b51416046d7ac4e9407a6eb1da6/FLAG2a6ba4f0e [2025-02-06 10:10:38,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00c324d2c/dcb84b51416046d7ac4e9407a6eb1da6 [2025-02-06 10:10:38,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:10:38,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:10:38,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:10:38,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:10:38,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:10:38,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:10:38" (1/1) ... [2025-02-06 10:10:38,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5cd72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:38, skipping insertion in model container [2025-02-06 10:10:38,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:10:38" (1/1) ... [2025-02-06 10:10:38,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:10:38,972 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:10:38,973 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:10:38,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:10:38,984 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:10:39,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:10:39,044 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:10:39,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39 WrapperNode [2025-02-06 10:10:39,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:10:39,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:10:39,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:10:39,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:10:39,051 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:10:39" (1/1) ... [2025-02-06 10:10:39,057 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:10:39" (1/1) ... [2025-02-06 10:10:39,073 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-02-06 10:10:39,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:10:39,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:10:39,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:10:39,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:10:39,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,093 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-02-06 10:10:39,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:10:39,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:10:39,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:10:39,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:10:39,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (1/1) ... [2025-02-06 10:10:39,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:10:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:39,140 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:10:39,150 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:10:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:10:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:10:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:10:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:10:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:10:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:10:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:10:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:10:39,229 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:10:39,231 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:10:39,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_#t~ret15#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:10:39,385 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-06 10:10:39,387 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:10:39,395 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:10:39,396 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:10:39,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:10:39 BoogieIcfgContainer [2025-02-06 10:10:39,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:10:39,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:10:39,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:10:39,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:10:39,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:10:38" (1/3) ... [2025-02-06 10:10:39,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60563140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:10:39, skipping insertion in model container [2025-02-06 10:10:39,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:10:39" (2/3) ... [2025-02-06 10:10:39,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60563140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:10:39, skipping insertion in model container [2025-02-06 10:10:39,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:10:39" (3/3) ... [2025-02-06 10:10:39,406 INFO L128 eAbstractionObserver]: Analyzing ICFG substring-alloca-1.i [2025-02-06 10:10:39,416 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:10:39,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG substring-alloca-1.i that has 1 procedures, 41 locations, 1 initial locations, 2 loop locations, and 15 error locations. [2025-02-06 10:10:39,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:10:39,457 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;@2c31cc73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:10:39,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-06 10:10:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:10:39,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:39,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:10:39,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:39,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1751807972, now seen corresponding path program 1 times [2025-02-06 10:10:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:39,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261518241] [2025-02-06 10:10:39,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:10:39,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:10:39,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:39,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:39,747 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:10:39,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:39,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261518241] [2025-02-06 10:10:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261518241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:39,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:10:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858376737] [2025-02-06 10:10:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:10:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:39,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:10:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:10:39,771 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:39,808 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-02-06 10:10:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:10:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:10:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:39,813 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:10:39,814 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:10:39,815 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:10:39,816 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:39,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:10:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:10:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-02-06 10:10:39,837 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2025-02-06 10:10:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:39,838 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-02-06 10:10:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-02-06 10:10:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:10:39,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:39,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:10:39,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:10:39,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:39,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1751807971, now seen corresponding path program 1 times [2025-02-06 10:10:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:39,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584154238] [2025-02-06 10:10:39,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:39,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:10:39,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:10:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:39,999 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:10:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584154238] [2025-02-06 10:10:40,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584154238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:10:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881454289] [2025-02-06 10:10:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:10:40,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:10:40,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:10:40,002 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,048 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-02-06 10:10:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:10:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:10:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,049 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:10:40,049 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 10:10:40,049 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:10:40,050 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 10:10:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-06 10:10:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-02-06 10:10:40,055 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2025-02-06 10:10:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,055 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-02-06 10:10:40,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-02-06 10:10:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:10:40,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:10:40,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1751778180, now seen corresponding path program 1 times [2025-02-06 10:10:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525223552] [2025-02-06 10:10:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:10:40,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:10:40,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,209 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:10:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525223552] [2025-02-06 10:10:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525223552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:10:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632884741] [2025-02-06 10:10:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:10:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:10:40,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:10:40,212 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,227 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-02-06 10:10:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:10:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:10:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,228 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:10:40,228 INFO L226 Difference]: Without dead ends: 40 [2025-02-06 10:10:40,229 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:10:40,229 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-06 10:10:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-02-06 10:10:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.75) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-06 10:10:40,232 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2025-02-06 10:10:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,232 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-06 10:10:40,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-06 10:10:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:10:40,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:10:40,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1528527730, now seen corresponding path program 1 times [2025-02-06 10:10:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601415057] [2025-02-06 10:10:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:10:40,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:10:40,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,269 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:10:40,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601415057] [2025-02-06 10:10:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601415057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:10:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596104389] [2025-02-06 10:10:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:10:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:10:40,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:10:40,274 INFO L87 Difference]: Start difference. First operand 37 states and 42 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:10:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,306 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-02-06 10:10:40,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:10:40,307 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:10:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,307 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:10:40,307 INFO L226 Difference]: Without dead ends: 36 [2025-02-06 10:10:40,307 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:10:40,308 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-06 10:10:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-06 10:10:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-02-06 10:10:40,312 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2025-02-06 10:10:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-02-06 10:10:40,313 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:10:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-02-06 10:10:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:10:40,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:10:40,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1528527731, now seen corresponding path program 1 times [2025-02-06 10:10:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009789592] [2025-02-06 10:10:40,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:10:40,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:10:40,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,455 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:10:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009789592] [2025-02-06 10:10:40,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009789592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:10:40,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679768484] [2025-02-06 10:10:40,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:10:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:10:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:10:40,458 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,474 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-02-06 10:10:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:10:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:10:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,476 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:10:40,476 INFO L226 Difference]: Without dead ends: 39 [2025-02-06 10:10:40,476 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:10:40,477 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-06 10:10:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-06 10:10:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-06 10:10:40,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 7 [2025-02-06 10:10:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-06 10:10:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-06 10:10:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:10:40,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:10:40,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1528557522, now seen corresponding path program 1 times [2025-02-06 10:10:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56109061] [2025-02-06 10:10:40,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:10:40,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:10:40,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,565 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:10:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56109061] [2025-02-06 10:10:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56109061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:10:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327814031] [2025-02-06 10:10:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:10:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:10:40,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:10:40,566 INFO L87 Difference]: Start difference. First operand 39 states and 44 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:10:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,579 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-06 10:10:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:10:40,579 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:10:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,581 INFO L225 Difference]: With dead ends: 38 [2025-02-06 10:10:40,581 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:10:40,581 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:10:40,581 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:10:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-02-06 10:10:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-06 10:10:40,583 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2025-02-06 10:10:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,583 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-06 10:10:40,583 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:10:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-06 10:10:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:10:40,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:10:40,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1126345080, now seen corresponding path program 1 times [2025-02-06 10:10:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439892934] [2025-02-06 10:10:40,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:10:40,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:10:40,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,618 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:10:40,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439892934] [2025-02-06 10:10:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439892934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:10:40,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254883833] [2025-02-06 10:10:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:10:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:10:40,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:10:40,619 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,647 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-02-06 10:10:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:10:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,648 INFO L225 Difference]: With dead ends: 34 [2025-02-06 10:10:40,648 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:10:40,648 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:10:40,648 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:10:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 10:10:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.625) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-02-06 10:10:40,650 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 10 [2025-02-06 10:10:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,650 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-02-06 10:10:40,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-02-06 10:10:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:10:40,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:10:40,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1126345081, now seen corresponding path program 1 times [2025-02-06 10:10:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076136503] [2025-02-06 10:10:40,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:10:40,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:10:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,748 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:10:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076136503] [2025-02-06 10:10:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076136503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:10:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105435462] [2025-02-06 10:10:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:10:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:10:40,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:10:40,749 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,797 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-02-06 10:10:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:10:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,798 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:10:40,798 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:10:40,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:10:40,799 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:10:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2025-02-06 10:10:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-02-06 10:10:40,801 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2025-02-06 10:10:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,801 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-02-06 10:10:40,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-02-06 10:10:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:10:40,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:10:40,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1633198580, now seen corresponding path program 1 times [2025-02-06 10:10:40,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8154894] [2025-02-06 10:10:40,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:10:40,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:10:40,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,844 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:10:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8154894] [2025-02-06 10:10:40,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8154894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:10:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174271952] [2025-02-06 10:10:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:10:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:10:40,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:10:40,845 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:40,884 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-02-06 10:10:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:10:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-06 10:10:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:40,885 INFO L225 Difference]: With dead ends: 33 [2025-02-06 10:10:40,885 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 10:10:40,885 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:10:40,885 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:40,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 51 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 10:10:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 10:10:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-06 10:10:40,887 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2025-02-06 10:10:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:40,887 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-06 10:10:40,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-02-06 10:10:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:10:40,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:40,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:10:40,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1633198579, now seen corresponding path program 1 times [2025-02-06 10:10:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655320956] [2025-02-06 10:10:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:40,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:10:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:10:40,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:40,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:40,989 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:10:40,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655320956] [2025-02-06 10:10:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655320956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:10:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765355485] [2025-02-06 10:10:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:40,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:10:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:40,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:10:40,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:10:40,990 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,048 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2025-02-06 10:10:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:10:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-06 10:10:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,048 INFO L225 Difference]: With dead ends: 44 [2025-02-06 10:10:41,048 INFO L226 Difference]: Without dead ends: 44 [2025-02-06 10:10:41,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:10:41,049 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:41,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 99 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-06 10:10:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-06 10:10:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.457142857142857) internal successors, (51), 41 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:10:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-02-06 10:10:41,050 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 13 [2025-02-06 10:10:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,051 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-02-06 10:10:41,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-02-06 10:10:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:10:41,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:10:41,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash 910395990, now seen corresponding path program 1 times [2025-02-06 10:10:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65292084] [2025-02-06 10:10:41,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:10:41,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:10:41,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,167 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:10:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65292084] [2025-02-06 10:10:41,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65292084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:10:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137627536] [2025-02-06 10:10:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:10:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:10:41,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:10:41,168 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,189 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-02-06 10:10:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:10:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-02-06 10:10:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,189 INFO L225 Difference]: With dead ends: 41 [2025-02-06 10:10:41,190 INFO L226 Difference]: Without dead ends: 38 [2025-02-06 10:10:41,190 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:10:41,190 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:41,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-06 10:10:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-06 10:10:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.4375) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-02-06 10:10:41,191 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 14 [2025-02-06 10:10:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,192 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-02-06 10:10:41,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-02-06 10:10:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:10:41,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:41,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:10:41,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash 544243559, now seen corresponding path program 1 times [2025-02-06 10:10:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416075410] [2025-02-06 10:10:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:10:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:10:41,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,245 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:10:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416075410] [2025-02-06 10:10:41,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416075410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:10:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334554616] [2025-02-06 10:10:41,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:10:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:10:41,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:10:41,246 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,278 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-02-06 10:10:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:10:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:10:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,279 INFO L225 Difference]: With dead ends: 37 [2025-02-06 10:10:41,279 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:10:41,279 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:10:41,279 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:41,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:10:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 10:10:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-02-06 10:10:41,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2025-02-06 10:10:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,280 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-02-06 10:10:41,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-02-06 10:10:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:10:41,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:41,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:10:41,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash 544243560, now seen corresponding path program 1 times [2025-02-06 10:10:41,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288982749] [2025-02-06 10:10:41,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:10:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:10:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,426 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:10:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288982749] [2025-02-06 10:10:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288982749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:10:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51126263] [2025-02-06 10:10:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:10:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:10:41,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:10:41,427 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,497 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-02-06 10:10:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:10:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:10:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,498 INFO L225 Difference]: With dead ends: 62 [2025-02-06 10:10:41,498 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 10:10:41,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:10:41,498 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:41,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 73 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 10:10:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2025-02-06 10:10:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) 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:10:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-02-06 10:10:41,500 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 17 [2025-02-06 10:10:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,500 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-02-06 10:10:41,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-02-06 10:10:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:10:41,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,501 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:41,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:10:41,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -308293497, now seen corresponding path program 1 times [2025-02-06 10:10:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899851325] [2025-02-06 10:10:41,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:10:41,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:10:41,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,524 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:10:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899851325] [2025-02-06 10:10:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899851325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:10:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892626928] [2025-02-06 10:10:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:10:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:10:41,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:10:41,525 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,531 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-02-06 10:10:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:10:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:10:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,532 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:10:41,532 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:10:41,532 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:10:41,532 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 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:10:41,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:10:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:10:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-02-06 10:10:41,534 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2025-02-06 10:10:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-06 10:10:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-02-06 10:10:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:10:41,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,534 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:10:41,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:10:41,535 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 81155557, now seen corresponding path program 1 times [2025-02-06 10:10:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488643830] [2025-02-06 10:10:41,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:10:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:10:41,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,579 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:10:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488643830] [2025-02-06 10:10:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488643830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:10:41,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840616058] [2025-02-06 10:10:41,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:10:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:10:41,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:10:41,580 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:10:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:41,604 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-02-06 10:10:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:10:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:10:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:41,604 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:10:41,604 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:10:41,605 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:10:41,605 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:41,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:10:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:10:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 45 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:10:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-02-06 10:10:41,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2025-02-06 10:10:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:41,608 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-02-06 10:10:41,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:10:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-02-06 10:10:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:10:41,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:41,609 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] [2025-02-06 10:10:41,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:10:41,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:41,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1807697668, now seen corresponding path program 1 times [2025-02-06 10:10:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817214397] [2025-02-06 10:10:41,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:10:41,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:10:41,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:41,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:41,839 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:10:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817214397] [2025-02-06 10:10:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817214397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:41,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:41,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 10:10:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227176492] [2025-02-06 10:10:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:41,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:10:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:41,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:10:41,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:10:41,840 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:42,006 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-02-06 10:10:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:10:42,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:10:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:42,007 INFO L225 Difference]: With dead ends: 64 [2025-02-06 10:10:42,007 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 10:10:42,007 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:10:42,008 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:42,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 182 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 10:10:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-02-06 10:10:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-02-06 10:10:42,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 21 [2025-02-06 10:10:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:42,010 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-02-06 10:10:42,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-02-06 10:10:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:10:42,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:42,010 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] [2025-02-06 10:10:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:10:42,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:42,012 INFO L85 PathProgramCache]: Analyzing trace with hash 963225797, now seen corresponding path program 1 times [2025-02-06 10:10:42,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684584873] [2025-02-06 10:10:42,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:42,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:10:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:10:42,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:42,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:42,161 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:10:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684584873] [2025-02-06 10:10:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684584873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:42,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:10:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760620192] [2025-02-06 10:10:42,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:10:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:42,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:10:42,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:10:42,162 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:42,223 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-02-06 10:10:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:10:42,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:10:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:42,223 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:10:42,223 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 10:10:42,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:10:42,224 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:42,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 10:10:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 10:10:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 61 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:10:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2025-02-06 10:10:42,226 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2025-02-06 10:10:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2025-02-06 10:10:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2025-02-06 10:10:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:10:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:42,226 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] [2025-02-06 10:10:42,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:10:42,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -33846556, now seen corresponding path program 1 times [2025-02-06 10:10:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973137415] [2025-02-06 10:10:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:42,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:10:42,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:10:42,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:42,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:42,523 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:10:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973137415] [2025-02-06 10:10:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973137415] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995481248] [2025-02-06 10:10:42,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:42,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:42,533 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:10:42,541 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:10:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:10:42,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:10:42,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:42,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:10:42,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:42,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 10:10:43,279 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:10:43,280 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 26 treesize of output 19 [2025-02-06 10:10:43,327 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:10:43,413 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:10:43,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:43,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 8 treesize of output 4 [2025-02-06 10:10:43,970 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:10:43,976 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:10:43,983 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:10:43,990 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:10:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995481248] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:43,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:43,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 26 [2025-02-06 10:10:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594735692] [2025-02-06 10:10:43,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:43,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:10:43,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:43,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:10:43,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:10:43,992 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 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:10:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:46,184 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2025-02-06 10:10:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:10:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 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) Word has length 21 [2025-02-06 10:10:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:46,185 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:10:46,185 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:10:46,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=265, Invalid=1216, Unknown=1, NotChecked=0, Total=1482 [2025-02-06 10:10:46,186 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:46,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 94 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:10:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:10:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2025-02-06 10:10:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 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:10:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-02-06 10:10:46,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 21 [2025-02-06 10:10:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-02-06 10:10:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 27 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:10:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-02-06 10:10:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:10:46,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:46,189 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:10:46,195 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:10:46,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 10:10:46,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:46,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1620309889, now seen corresponding path program 1 times [2025-02-06 10:10:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932178749] [2025-02-06 10:10:46,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:46,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:46,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:10:46,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:10:46,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:46,510 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:10:46,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:46,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932178749] [2025-02-06 10:10:46,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932178749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:10:46,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:10:46,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:10:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712289008] [2025-02-06 10:10:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:10:46,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:10:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:46,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:10:46,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:10:46,512 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:46,539 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-02-06 10:10:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:10:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 10:10:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:46,540 INFO L225 Difference]: With dead ends: 40 [2025-02-06 10:10:46,540 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 10:10:46,540 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:10:46,541 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:46,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:10:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 10:10:46,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-06 10:10:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-02-06 10:10:46,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2025-02-06 10:10:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-02-06 10:10:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-02-06 10:10:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:10:46,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:46,546 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:10:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:10:46,546 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1831660802, now seen corresponding path program 1 times [2025-02-06 10:10:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191785452] [2025-02-06 10:10:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:10:46,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:10:46,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:46,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:46,691 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:10:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191785452] [2025-02-06 10:10:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191785452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815362561] [2025-02-06 10:10:46,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:46,694 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:10:46,695 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:10:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:10:46,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:10:46,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:46,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:46,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:10:46,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:46,765 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:10:46,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:10:46,842 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:10:46,963 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:10:46,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:47,122 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:10:47,125 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:10:47,131 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:10:47,140 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:10:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815362561] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:47,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-02-06 10:10:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135032773] [2025-02-06 10:10:47,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:10:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:47,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:10:47,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:10:47,142 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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:10:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:47,313 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-02-06 10:10:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:10:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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) Word has length 23 [2025-02-06 10:10:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:47,314 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:10:47,314 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:10:47,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:10:47,315 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:47,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 169 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:47,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:10:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2025-02-06 10:10:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-06 10:10:47,316 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 23 [2025-02-06 10:10:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:47,316 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-06 10:10:47,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 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:10:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-06 10:10:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:10:47,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:47,317 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] [2025-02-06 10:10:47,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:10:47,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:47,526 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:47,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:47,527 INFO L85 PathProgramCache]: Analyzing trace with hash 765749439, now seen corresponding path program 1 times [2025-02-06 10:10:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:47,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478897550] [2025-02-06 10:10:47,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:47,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:10:47,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:10:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478897550] [2025-02-06 10:10:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478897550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:47,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293339894] [2025-02-06 10:10:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:47,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:47,814 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:10:47,819 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:10:47,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:10:47,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:10:47,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:47,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:47,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:10:47,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:47,933 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:10:48,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:10:48,062 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:10:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:48,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:48,405 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:10:48,408 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:10:48,412 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:10:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293339894] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:48,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2025-02-06 10:10:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774655861] [2025-02-06 10:10:48,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:48,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:10:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:48,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:10:48,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:10:48,420 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 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:10:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:50,163 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-02-06 10:10:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:10:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 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) Word has length 25 [2025-02-06 10:10:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:50,164 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:10:50,164 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:10:50,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=124, Invalid=804, Unknown=2, NotChecked=0, Total=930 [2025-02-06 10:10:50,165 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 206 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:50,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 166 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:10:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-02-06 10:10:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.12) internal successors, (56), 51 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:10:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-02-06 10:10:50,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2025-02-06 10:10:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:50,167 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-02-06 10:10:50,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 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:10:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-02-06 10:10:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:10:50,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:50,168 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] [2025-02-06 10:10:50,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:10:50,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:50,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:50,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:50,373 INFO L85 PathProgramCache]: Analyzing trace with hash -43655233, now seen corresponding path program 1 times [2025-02-06 10:10:50,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:50,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418383682] [2025-02-06 10:10:50,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:50,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:10:50,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:10:50,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:50,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:50,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418383682] [2025-02-06 10:10:50,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418383682] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:50,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032001233] [2025-02-06 10:10:50,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:50,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:50,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:50,569 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:10:50,573 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:10:50,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:10:50,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:10:50,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:50,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:50,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:10:50,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:50,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:50,715 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 7 treesize of output 5 [2025-02-06 10:10:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032001233] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:50,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-02-06 10:10:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753035583] [2025-02-06 10:10:50,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:50,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:10:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:50,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:10:50,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:10:50,744 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 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:10:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:50,831 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-02-06 10:10:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:10:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 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) Word has length 30 [2025-02-06 10:10:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:50,833 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:10:50,834 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:10:50,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:10:50,835 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:50,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 88 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:50,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:10:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2025-02-06 10:10:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-02-06 10:10:50,836 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 30 [2025-02-06 10:10:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:50,836 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-02-06 10:10:50,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 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:10:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-02-06 10:10:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:10:50,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:50,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:50,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:10:51,040 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,SelfDestructingSolverStorable21 [2025-02-06 10:10:51,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 862566198, now seen corresponding path program 2 times [2025-02-06 10:10:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011978251] [2025-02-06 10:10:51,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:10:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:51,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 10:10:51,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:10:51,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:10:51,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:51,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011978251] [2025-02-06 10:10:51,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011978251] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:51,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074129843] [2025-02-06 10:10:51,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:10:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:51,532 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:10:51,536 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:10:51,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 10:10:51,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:10:51,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:10:51,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:51,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 10:10:51,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:51,638 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:10:52,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:10:52,335 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 35 treesize of output 31 [2025-02-06 10:10:52,403 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-02-06 10:10:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2025-02-06 10:10:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:52,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:53,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:10:53,263 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 41 treesize of output 36 [2025-02-06 10:10:53,433 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:10:53,438 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:10:53,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-06 10:10:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074129843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:53,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 20] total 51 [2025-02-06 10:10:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251456706] [2025-02-06 10:10:53,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 10:10:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:53,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 10:10:53,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:10:53,531 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 52 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 52 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:10:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:55,512 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2025-02-06 10:10:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 10:10:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 52 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 33 [2025-02-06 10:10:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:55,514 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:10:55,514 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:10:55,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=668, Invalid=5338, Unknown=0, NotChecked=0, Total=6006 [2025-02-06 10:10:55,515 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 161 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:55,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 279 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:10:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:10:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2025-02-06 10:10:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-06 10:10:55,518 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2025-02-06 10:10:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:55,518 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-06 10:10:55,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 52 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:10:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-06 10:10:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:10:55,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:55,519 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] [2025-02-06 10:10:55,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:10:55,719 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,SelfDestructingSolverStorable22 [2025-02-06 10:10:55,720 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:55,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1520280633, now seen corresponding path program 2 times [2025-02-06 10:10:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:55,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148141963] [2025-02-06 10:10:55,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:10:55,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:55,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:10:55,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:10:55,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:10:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148141963] [2025-02-06 10:10:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148141963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6480695] [2025-02-06 10:10:56,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:10:56,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:56,062 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:10:56,069 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:10:56,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 10:10:56,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:10:56,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:10:56,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:56,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:10:56,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:56,148 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:10:56,381 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-02-06 10:10:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2025-02-06 10:10:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:56,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:56,725 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:10:56,730 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:10:56,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-06 10:10:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6480695] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:56,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-02-06 10:10:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747958210] [2025-02-06 10:10:56,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:56,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:10:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:56,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:10:56,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:10:56,768 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:56,999 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2025-02-06 10:10:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:10:56,999 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 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 36 [2025-02-06 10:10:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:57,000 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:10:57,000 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:10:57,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:10:57,001 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 93 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:57,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 265 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:10:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:10:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2025-02-06 10:10:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2025-02-06 10:10:57,005 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 36 [2025-02-06 10:10:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:57,005 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2025-02-06 10:10:57,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2025-02-06 10:10:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:10:57,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:57,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:57,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:10:57,210 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,SelfDestructingSolverStorable23 [2025-02-06 10:10:57,210 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2117849546, now seen corresponding path program 1 times [2025-02-06 10:10:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145787273] [2025-02-06 10:10:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:57,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:10:57,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:10:57,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:57,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:10:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145787273] [2025-02-06 10:10:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145787273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:10:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046787581] [2025-02-06 10:10:57,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:10:57,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:10:57,586 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:10:57,589 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:10:57,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:10:57,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:10:57,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:10:57,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:10:57,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:10:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:10:57,671 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:10:58,128 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:10:58,145 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-02-06 10:10:58,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2025-02-06 10:10:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:58,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:10:58,362 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 12 treesize of output 8 [2025-02-06 10:10:58,650 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:10:58,653 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:10:58,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-02-06 10:10:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:10:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046787581] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:10:58,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:10:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 36 [2025-02-06 10:10:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189435456] [2025-02-06 10:10:58,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:10:58,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:10:58,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:10:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:10:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:10:58,685 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 37 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:10:59,610 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2025-02-06 10:10:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:10:59,610 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 37 states have internal predecessors, (101), 0 states have call successors, (0), 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:10:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:10:59,611 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:10:59,611 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:10:59,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:10:59,612 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 171 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:10:59,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 329 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:10:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:10:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 55. [2025-02-06 10:10:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-02-06 10:10:59,614 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 38 [2025-02-06 10:10:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:10:59,615 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-02-06 10:10:59,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 37 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:10:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-02-06 10:10:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:10:59,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:10:59,615 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:10:59,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:10:59,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:10:59,816 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:10:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:10:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1916529235, now seen corresponding path program 2 times [2025-02-06 10:10:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:10:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980558276] [2025-02-06 10:10:59,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:10:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:10:59,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:10:59,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:10:59,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:10:59,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:11:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980558276] [2025-02-06 10:11:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980558276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:11:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166068255] [2025-02-06 10:11:00,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:11:00,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:11:00,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:11:00,313 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:11:00,319 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:11:00,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:11:00,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:11:00,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:11:00,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:00,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 10:11:00,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:11:00,433 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:11:01,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:01,348 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 35 treesize of output 31 [2025-02-06 10:11:01,426 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 10:11:01,426 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 33 treesize of output 31 [2025-02-06 10:11:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:01,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:11:02,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:02,292 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 41 treesize of output 36 [2025-02-06 10:11:02,714 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:11:02,718 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:11:02,722 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:11:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166068255] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:11:02,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:11:02,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 23] total 58 [2025-02-06 10:11:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428398631] [2025-02-06 10:11:02,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:11:02,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-06 10:11:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:11:02,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-06 10:11:02,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3174, Unknown=0, NotChecked=0, Total=3422 [2025-02-06 10:11:02,794 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 59 states, 58 states have (on average 2.2758620689655173) internal successors, (132), 59 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:11:09,149 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2025-02-06 10:11:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-06 10:11:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.2758620689655173) internal successors, (132), 59 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:11:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:11:09,150 INFO L225 Difference]: With dead ends: 218 [2025-02-06 10:11:09,150 INFO L226 Difference]: Without dead ends: 218 [2025-02-06 10:11:09,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6588 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2575, Invalid=18305, Unknown=0, NotChecked=0, Total=20880 [2025-02-06 10:11:09,154 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 487 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:11:09,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 442 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 10:11:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-06 10:11:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 168. [2025-02-06 10:11:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.1077844311377245) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2025-02-06 10:11:09,158 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 46 [2025-02-06 10:11:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:11:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2025-02-06 10:11:09,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.2758620689655173) internal successors, (132), 59 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2025-02-06 10:11:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:11:09,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:11:09,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:11:09,164 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:11:09,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 10:11:09,363 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:11:09,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:11:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2043666652, now seen corresponding path program 3 times [2025-02-06 10:11:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:11:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960382147] [2025-02-06 10:11:09,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:11:09,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:11:09,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 5 equivalence classes. [2025-02-06 10:11:09,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:11:09,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:11:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:09,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:11:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960382147] [2025-02-06 10:11:09,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960382147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:11:09,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651105091] [2025-02-06 10:11:09,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:11:09,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:11:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:11:09,831 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:11:09,832 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:11:09,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 5 equivalence classes. [2025-02-06 10:11:09,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:11:09,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:11:09,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:09,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 10:11:09,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:11:09,945 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:11:11,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:11,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2025-02-06 10:11:11,534 INFO L349 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2025-02-06 10:11:11,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 93 [2025-02-06 10:11:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:11,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:11:13,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:13,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 67 [2025-02-06 10:11:14,026 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 53 treesize of output 45 [2025-02-06 10:11:14,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:14,055 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 77 treesize of output 117 [2025-02-06 10:11:14,065 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:11:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651105091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:11:14,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:11:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 29] total 71 [2025-02-06 10:11:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345834965] [2025-02-06 10:11:14,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:11:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-02-06 10:11:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:11:14,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-02-06 10:11:14,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4669, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 10:11:14,162 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 72 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 72 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:11:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:11:20,714 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2025-02-06 10:11:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-06 10:11:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 72 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 49 [2025-02-06 10:11:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:11:20,716 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:11:20,716 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:11:20,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4517 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2086, Invalid=12434, Unknown=0, NotChecked=0, Total=14520 [2025-02-06 10:11:20,719 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 495 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:11:20,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 317 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:11:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:11:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2025-02-06 10:11:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.1099476439790577) internal successors, (212), 191 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2025-02-06 10:11:20,722 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 49 [2025-02-06 10:11:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:11:20,722 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2025-02-06 10:11:20,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 72 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:11:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2025-02-06 10:11:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 10:11:20,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:11:20,723 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:11:20,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:11:20,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:11:20,924 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:11:20,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:11:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash -888885349, now seen corresponding path program 3 times [2025-02-06 10:11:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:11:20,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636325698] [2025-02-06 10:11:20,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:11:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:11:20,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 5 equivalence classes. [2025-02-06 10:11:20,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:11:20,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:11:20,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:11:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636325698] [2025-02-06 10:11:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636325698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:11:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942923323] [2025-02-06 10:11:21,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:11:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:11:21,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:11:21,485 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:11:21,486 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:11:21,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 5 equivalence classes. [2025-02-06 10:11:21,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 10:11:21,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-06 10:11:21,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:11:21,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-02-06 10:11:21,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:11:21,646 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:11:23,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:23,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2025-02-06 10:11:23,706 INFO L349 Elim1Store]: treesize reduction 16, result has 86.6 percent of original size [2025-02-06 10:11:23,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 125 [2025-02-06 10:11:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:24,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:11:25,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:25,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 67 [2025-02-06 10:11:27,417 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 68 treesize of output 58 [2025-02-06 10:11:27,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:11:27,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 158 [2025-02-06 10:11:27,476 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:11:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:11:27,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942923323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:11:27,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:11:27,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 32, 32] total 79 [2025-02-06 10:11:27,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605440622] [2025-02-06 10:11:27,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:11:27,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2025-02-06 10:11:27,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:11:27,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2025-02-06 10:11:27,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=5839, Unknown=0, NotChecked=0, Total=6320 [2025-02-06 10:11:27,614 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand has 80 states, 79 states have (on average 2.278481012658228) internal successors, (180), 80 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:11:56,230 INFO L93 Difference]: Finished difference Result 332 states and 362 transitions. [2025-02-06 10:11:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2025-02-06 10:11:56,230 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 2.278481012658228) internal successors, (180), 80 states have internal predecessors, (180), 0 states have call successors, (0), 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 62 [2025-02-06 10:11:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:11:56,231 INFO L225 Difference]: With dead ends: 332 [2025-02-06 10:11:56,231 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 10:11:56,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22858 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=8407, Invalid=50885, Unknown=0, NotChecked=0, Total=59292 [2025-02-06 10:11:56,235 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1204 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:11:56,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 402 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 10:11:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 10:11:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 248. [2025-02-06 10:11:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.1133603238866396) internal successors, (275), 247 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2025-02-06 10:11:56,240 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 62 [2025-02-06 10:11:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:11:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2025-02-06 10:11:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 2.278481012658228) internal successors, (180), 80 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:11:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2025-02-06 10:11:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 10:11:56,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:11:56,241 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:11:56,250 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:11:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:11:56,445 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-02-06 10:11:56,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:11:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash 730347145, now seen corresponding path program 4 times [2025-02-06 10:11:56,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:11:56,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220744645] [2025-02-06 10:11:56,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:11:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:11:56,451 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-02-06 10:11:56,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 71 of 73 statements. [2025-02-06 10:11:56,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:11:56,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220744645] [2025-02-06 10:12:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220744645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:01,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297284072] [2025-02-06 10:12:01,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:12:01,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:01,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:01,540 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:12:01,541 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:12:01,593 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 73 statements into 2 equivalence classes. [2025-02-06 10:12:01,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 71 of 73 statements. [2025-02-06 10:12:01,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:12:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:01,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-06 10:12:01,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:01,643 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:12:13,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:12:13,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 142 treesize of output 338 [2025-02-06 10:12:14,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:12:14,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 115 treesize of output 221 [2025-02-06 10:12:14,730 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-06 10:12:14,750 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-06 10:12:14,814 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-06 10:12:14,871 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-06 10:12:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 150 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:15,482 INFO L312 TraceCheckSpWp]: Computing backward predicates...