./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:11:45,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:11:45,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:11:45,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:11:45,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:11:45,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:11:45,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:11:45,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:11:45,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:11:45,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:11:45,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:11:45,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:11:45,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:11:45,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:11:45,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:11:45,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:11:45,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:11:45,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:11:45,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:11:45,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:11:45,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f [2025-02-08 06:11:45,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:11:45,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:11:45,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:11:45,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:11:45,661 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:11:45,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2025-02-08 06:11:46,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d5b3e99/2d93a7e8c1e7460a83c158bae6d68702/FLAG7183809fa [2025-02-08 06:11:47,212 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:11:47,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2025-02-08 06:11:47,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d5b3e99/2d93a7e8c1e7460a83c158bae6d68702/FLAG7183809fa [2025-02-08 06:11:47,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8d5b3e99/2d93a7e8c1e7460a83c158bae6d68702 [2025-02-08 06:11:47,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:11:47,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:11:47,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:11:47,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:11:47,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:11:47,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb4cf07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47, skipping insertion in model container [2025-02-08 06:11:47,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:11:47,620 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-08 06:11:47,621 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-08 06:11:47,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:11:47,634 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:11:47,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:11:47,674 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:11:47,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47 WrapperNode [2025-02-08 06:11:47,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:11:47,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:11:47,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:11:47,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:11:47,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,698 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-02-08 06:11:47,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:11:47,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:11:47,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:11:47,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:11:47,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,714 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-08 06:11:47,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:11:47,723 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:11:47,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:11:47,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:11:47,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (1/1) ... [2025-02-08 06:11:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:11:47,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:47,754 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-08 06:11:47,758 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-08 06:11:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:11:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:11:47,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:11:47,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:11:47,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:11:47,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:11:47,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:11:47,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:11:47,840 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:11:47,842 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:11:48,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~ret18#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-08 06:11:48,043 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-08 06:11:48,044 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:11:48,050 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:11:48,050 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:11:48,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:11:48 BoogieIcfgContainer [2025-02-08 06:11:48,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:11:48,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:11:48,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:11:48,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:11:48,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:11:47" (1/3) ... [2025-02-08 06:11:48,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df44a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:11:48, skipping insertion in model container [2025-02-08 06:11:48,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:11:47" (2/3) ... [2025-02-08 06:11:48,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df44a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:11:48, skipping insertion in model container [2025-02-08 06:11:48,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:11:48" (3/3) ... [2025-02-08 06:11:48,060 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2025-02-08 06:11:48,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:11:48,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcspn-alloca-1.i that has 1 procedures, 51 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-08 06:11:48,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:11:48,121 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;@163bccfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:11:48,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 06:11:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:11:48,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:48,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:11:48,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:48,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1456926724, now seen corresponding path program 1 times [2025-02-08 06:11:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665358130] [2025-02-08 06:11:48,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:48,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:11:48,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:11:48,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:48,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:48,333 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-08 06:11:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665358130] [2025-02-08 06:11:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665358130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:48,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543003346] [2025-02-08 06:11:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:48,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:48,355 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) 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-08 06:11:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:48,402 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-08 06:11:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-08 06:11:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:48,408 INFO L225 Difference]: With dead ends: 61 [2025-02-08 06:11:48,408 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:11:48,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:48,412 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:48,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 146 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:11:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-08 06:11:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.8125) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-08 06:11:48,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 6 [2025-02-08 06:11:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:48,448 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-08 06:11:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-08 06:11:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-08 06:11:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:11:48,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:48,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:11:48,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:11:48,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003203, now seen corresponding path program 1 times [2025-02-08 06:11:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555505195] [2025-02-08 06:11:48,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:48,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:11:48,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:11:48,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:48,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:48,553 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-08 06:11:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555505195] [2025-02-08 06:11:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555505195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:11:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946887896] [2025-02-08 06:11:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:48,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:11:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:48,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:11:48,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:11:48,555 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. 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-08 06:11:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:48,606 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-02-08 06:11:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:11:48,606 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-08 06:11:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:48,607 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:11:48,607 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:11:48,607 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-08 06:11:48,608 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:48,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:11:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:11:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.75) internal successors, (56), 48 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-08 06:11:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-08 06:11:48,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 6 [2025-02-08 06:11:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:48,614 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-08 06:11:48,614 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-08 06:11:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-08 06:11:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:11:48,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:48,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:11:48,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:11:48,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:48,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1456003202, now seen corresponding path program 1 times [2025-02-08 06:11:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226315376] [2025-02-08 06:11:48,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:48,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:11:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:11:48,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:48,833 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-08 06:11:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226315376] [2025-02-08 06:11:48,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226315376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:48,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867986304] [2025-02-08 06:11:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:48,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:11:48,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:48,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:11:48,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:11:48,836 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 4 states have (on average 1.5) 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-08 06:11:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:48,944 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-02-08 06:11:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:11:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) 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-08 06:11:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:48,945 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:11:48,946 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:11:48,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:11:48,948 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 128 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:11:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 06:11:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:11:48,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 6 [2025-02-08 06:11:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:48,955 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:11:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) 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-08 06:11:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:11:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:11:48,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:48,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:48,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:11:48,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:48,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906776, now seen corresponding path program 1 times [2025-02-08 06:11:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905041573] [2025-02-08 06:11:48,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:48,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:11:48,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:11:48,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:48,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,166 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-08 06:11:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905041573] [2025-02-08 06:11:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905041573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612545055] [2025-02-08 06:11:49,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:49,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:49,167 INFO L87 Difference]: Start difference. First operand 51 states and 59 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-08 06:11:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,214 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-02-08 06:11:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:49,215 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-08 06:11:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,215 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:11:49,215 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:11:49,215 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-08 06:11:49,218 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:49,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:11:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-02-08 06:11:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.736842105263158) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-08 06:11:49,220 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 7 [2025-02-08 06:11:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,220 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-08 06:11:49,220 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-08 06:11:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-08 06:11:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:11:49,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:11:49,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2079906935, now seen corresponding path program 1 times [2025-02-08 06:11:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723190516] [2025-02-08 06:11:49,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:11:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:11:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:49,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723190516] [2025-02-08 06:11:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723190516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:49,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905426781] [2025-02-08 06:11:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:49,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:49,278 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,329 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-02-08 06:11:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:49,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:11:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,331 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:11:49,331 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:11:49,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:49,332 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 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-08 06:11:49,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:11:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-08 06:11:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 64 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-08 06:11:49,339 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 7 [2025-02-08 06:11:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,340 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-08 06:11:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-08 06:11:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:11:49,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:11:49,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830456, now seen corresponding path program 1 times [2025-02-08 06:11:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006938635] [2025-02-08 06:11:49,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:11:49,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:11:49,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,499 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-08 06:11:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006938635] [2025-02-08 06:11:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006938635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960379465] [2025-02-08 06:11:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:11:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:11:49,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:11:49,501 INFO L87 Difference]: Start difference. First operand 65 states and 79 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-08 06:11:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,552 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-08 06:11:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:11:49,553 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-08 06:11:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,553 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:11:49,553 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:11:49,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:11:49,554 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:49,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:11:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-02-08 06:11:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2025-02-08 06:11:49,560 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 7 [2025-02-08 06:11:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,560 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2025-02-08 06:11:49,561 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-08 06:11:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2025-02-08 06:11:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:11:49,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:11:49,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2080830457, now seen corresponding path program 1 times [2025-02-08 06:11:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583811700] [2025-02-08 06:11:49,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:11:49,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:11:49,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,653 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-08 06:11:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583811700] [2025-02-08 06:11:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583811700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615240042] [2025-02-08 06:11:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:11:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:11:49,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:11:49,654 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.4) 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-08 06:11:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,716 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-02-08 06:11:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:11:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) 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-08 06:11:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,716 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:11:49,717 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:11:49,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:11:49,717 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:49,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:11:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-02-08 06:11:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:11:49,720 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:11:49,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:11:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) 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-08 06:11:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:11:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:11:49,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:11:49,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2108535927, now seen corresponding path program 1 times [2025-02-08 06:11:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245781243] [2025-02-08 06:11:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:11:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:11:49,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,817 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-08 06:11:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245781243] [2025-02-08 06:11:49,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245781243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073710684] [2025-02-08 06:11:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:11:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:11:49,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:11:49,819 INFO L87 Difference]: Start difference. First operand 67 states and 82 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-08 06:11:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,846 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-02-08 06:11:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:11:49,846 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-08 06:11:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,847 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:11:49,847 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:11:49,847 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-08 06:11:49,848 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:49,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:11:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2025-02-08 06:11:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-08 06:11:49,851 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 7 [2025-02-08 06:11:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,851 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-08 06:11:49,851 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-08 06:11:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-08 06:11:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:11:49,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:11:49,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,852 INFO L85 PathProgramCache]: Analyzing trace with hash 52600599, now seen corresponding path program 1 times [2025-02-08 06:11:49,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169395623] [2025-02-08 06:11:49,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:11:49,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:11:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:49,952 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-08 06:11:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169395623] [2025-02-08 06:11:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169395623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:49,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101263533] [2025-02-08 06:11:49,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:49,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:49,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:49,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:49,955 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:49,972 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-02-08 06:11:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:11:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:49,973 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:11:49,973 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:11:49,974 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-08 06:11:49,974 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:49,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:11:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-08 06:11:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-02-08 06:11:49,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 8 [2025-02-08 06:11:49,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:49,980 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-02-08 06:11:49,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-02-08 06:11:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:11:49,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:49,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:49,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:11:49,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 81229750, now seen corresponding path program 1 times [2025-02-08 06:11:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065438299] [2025-02-08 06:11:49,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:49,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:11:49,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:11:49,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:49,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:50,057 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-08 06:11:50,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:50,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065438299] [2025-02-08 06:11:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065438299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99222308] [2025-02-08 06:11:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:11:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:50,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:11:50,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:11:50,059 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:50,088 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:11:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:11:50,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 06:11:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:50,089 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:11:50,089 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:11:50,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-08 06:11:50,089 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:50,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 90 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:11:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-08 06:11:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 65 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2025-02-08 06:11:50,092 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 8 [2025-02-08 06:11:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:50,092 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2025-02-08 06:11:50,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2025-02-08 06:11:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:11:50,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:50,094 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:50,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:11:50,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:50,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash -916672325, now seen corresponding path program 1 times [2025-02-08 06:11:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993094936] [2025-02-08 06:11:50,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:11:50,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:11:50,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:50,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:50,297 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-08 06:11:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993094936] [2025-02-08 06:11:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993094936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75205732] [2025-02-08 06:11:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:50,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:50,303 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-08 06:11:50,311 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-08 06:11:50,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:11:50,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:11:50,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:50,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:50,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:11:50,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:50,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:11:50,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:11:50,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 10 treesize of output 8 [2025-02-08 06:11:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:50,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:50,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:11:50,635 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-08 06:11:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75205732] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:50,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-02-08 06:11:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258871454] [2025-02-08 06:11:50,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:11:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:11:50,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:11:50,637 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:50,815 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-02-08 06:11:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:11:50,815 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:11:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:50,815 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:11:50,815 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:11:50,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:11:50,816 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:50,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:11:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-02-08 06:11:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.54) internal successors, (77), 62 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-02-08 06:11:50,818 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 9 [2025-02-08 06:11:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-02-08 06:11:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-02-08 06:11:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:11:50,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:50,819 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:50,825 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-08 06:11:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:11:51,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 757151514, now seen corresponding path program 1 times [2025-02-08 06:11:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:51,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009648115] [2025-02-08 06:11:51,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:11:51,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:11:51,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:51,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:51,239 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-08 06:11:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009648115] [2025-02-08 06:11:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009648115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812666051] [2025-02-08 06:11:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:51,241 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-08 06:11:51,246 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-08 06:11:51,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:11:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:11:51,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:51,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:51,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:11:51,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:51,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-02-08 06:11:51,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:11:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:51,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:51,639 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-08 06:11:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812666051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:51,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-02-08 06:11:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652599981] [2025-02-08 06:11:51,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:51,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:11:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:51,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:11:51,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:11:51,640 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:51,832 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-02-08 06:11:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:11:51,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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-08 06:11:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:51,833 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:11:51,833 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:11:51,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:11:51,833 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:51,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 262 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:11:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-02-08 06:11:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.5) internal successors, (69), 57 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-08 06:11:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2025-02-08 06:11:51,835 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 10 [2025-02-08 06:11:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2025-02-08 06:11:51,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2025-02-08 06:11:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:11:51,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:51,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:51,842 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-08 06:11:52,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:52,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1647923930, now seen corresponding path program 1 times [2025-02-08 06:11:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357961787] [2025-02-08 06:11:52,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:52,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:11:52,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:11:52,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:52,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357961787] [2025-02-08 06:11:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357961787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453120937] [2025-02-08 06:11:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:52,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:52,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:52,197 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-08 06:11:52,198 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-08 06:11:52,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:11:52,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:11:52,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:52,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:52,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:11:52,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:52,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:11:52,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-02-08 06:11:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 06:11:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:52,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:52,425 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:11:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:52,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453120937] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:11:52,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 14 [2025-02-08 06:11:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036248129] [2025-02-08 06:11:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:52,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:11:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:52,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:11:52,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:11:52,454 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 06:11:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:52,543 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-08 06:11:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:11:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 06:11:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:52,544 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:11:52,544 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:11:52,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:11:52,545 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:52,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:11:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-02-08 06:11:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-08 06:11:52,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 10 [2025-02-08 06:11:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:52,547 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-08 06:11:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-08 06:11:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-08 06:11:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:11:52,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:52,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:52,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:11:52,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:52,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:52,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -638636173, now seen corresponding path program 1 times [2025-02-08 06:11:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722523635] [2025-02-08 06:11:52,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:11:52,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:11:52,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:52,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:52,786 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-08 06:11:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722523635] [2025-02-08 06:11:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722523635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146893722] [2025-02-08 06:11:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:52,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:52,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:52,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:52,788 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:52,814 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-02-08 06:11:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:52,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:11:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:52,815 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:11:52,815 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:11:52,815 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-08 06:11:52,815 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 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-08 06:11:52,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:11:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 06:11:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 47 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-08 06:11:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-08 06:11:52,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 11 [2025-02-08 06:11:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-08 06:11:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-08 06:11:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:11:52,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:52,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:52,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:11:52,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:52,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -638636172, now seen corresponding path program 1 times [2025-02-08 06:11:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922082385] [2025-02-08 06:11:52,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:52,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:11:52,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:11:52,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:52,873 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-08 06:11:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922082385] [2025-02-08 06:11:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922082385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:52,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:11:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228214164] [2025-02-08 06:11:52,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:52,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:11:52,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:52,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:11:52,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:11:52,875 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:52,929 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-02-08 06:11:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:11:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:11:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:52,930 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:11:52,930 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 06:11:52,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:11:52,930 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:52,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 98 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 06:11:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. [2025-02-08 06:11:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-08 06:11:52,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-02-08 06:11:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:52,932 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-08 06:11:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-08 06:11:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:11:52,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:52,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:52,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:11:52,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:52,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1094895406, now seen corresponding path program 1 times [2025-02-08 06:11:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:52,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771524692] [2025-02-08 06:11:52,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:11:52,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:11:52,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:52,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,008 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-08 06:11:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771524692] [2025-02-08 06:11:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771524692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:11:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645175738] [2025-02-08 06:11:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:11:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:11:53,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:11:53,013 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-08 06:11:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,035 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2025-02-08 06:11:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:11:53,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-08 06:11:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,036 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:11:53,036 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:11:53,036 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-08 06:11:53,037 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:11:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:11:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-02-08 06:11:53,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 14 [2025-02-08 06:11:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,038 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-02-08 06:11:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-08 06:11:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-02-08 06:11:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:11:53,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:53,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:11:53,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -70776497, now seen corresponding path program 1 times [2025-02-08 06:11:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813134500] [2025-02-08 06:11:53,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:11:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:11:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,078 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-08 06:11:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813134500] [2025-02-08 06:11:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813134500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:11:53,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525527032] [2025-02-08 06:11:53,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:11:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:11:53,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:11:53,080 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,111 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-02-08 06:11:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:11:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:11:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,112 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:11:53,112 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:11:53,112 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-08 06:11:53,112 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:11:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:11:53,113 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-08 06:11:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-02-08 06:11:53,114 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2025-02-08 06:11:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,114 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-02-08 06:11:53,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-02-08 06:11:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:11:53,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:11:53,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash -70776496, now seen corresponding path program 1 times [2025-02-08 06:11:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062297740] [2025-02-08 06:11:53,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:11:53,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:11:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,221 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-08 06:11:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062297740] [2025-02-08 06:11:53,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062297740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:11:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295419470] [2025-02-08 06:11:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:11:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:11:53,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:11:53,223 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,293 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-02-08 06:11:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:11:53,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-08 06:11:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,294 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:11:53,294 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:11:53,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:11:53,295 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:11:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-08 06:11:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-08 06:11:53,296 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 16 [2025-02-08 06:11:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,296 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-08 06:11:53,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-08 06:11:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:11:53,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,297 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-08 06:11:53,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:11:53,297 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash 54391714, now seen corresponding path program 1 times [2025-02-08 06:11:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939183272] [2025-02-08 06:11:53,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:11:53,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:11:53,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,315 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-08 06:11:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939183272] [2025-02-08 06:11:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939183272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:11:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840904604] [2025-02-08 06:11:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:11:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:11:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:11:53,317 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 06:11:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,323 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-02-08 06:11:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:11:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 06:11:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,323 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:11:53,323 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:11:53,324 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-08 06:11:53,324 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:11:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 06:11:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-02-08 06:11:53,325 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2025-02-08 06:11:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,325 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-02-08 06:11:53,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 06:11:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-02-08 06:11:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:11:53,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,326 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-08 06:11:53,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:11:53,326 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash 703740836, now seen corresponding path program 1 times [2025-02-08 06:11:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577667702] [2025-02-08 06:11:53,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:11:53,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:11:53,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:11:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577667702] [2025-02-08 06:11:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577667702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:11:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384596319] [2025-02-08 06:11:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:11:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:11:53,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:11:53,430 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,461 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-02-08 06:11:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:11:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:11:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,462 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:11:53,462 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:11:53,462 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-08 06:11:53,462 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:11:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:11:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-08 06:11:53,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 23 [2025-02-08 06:11:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,464 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-08 06:11:53,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-08 06:11:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:11:53,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,465 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-08 06:11:53,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:11:53,465 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1334315453, now seen corresponding path program 1 times [2025-02-08 06:11:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304111654] [2025-02-08 06:11:53,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:11:53,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:11:53,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:11:53,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304111654] [2025-02-08 06:11:53,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304111654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:11:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009877352] [2025-02-08 06:11:53,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:11:53,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:11:53,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:11:53,594 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,630 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 06:11:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:11:53,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:11:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,631 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:11:53,631 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:11:53,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:11:53,631 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:11:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-02-08 06:11:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-08 06:11:53,633 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2025-02-08 06:11:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,633 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-08 06:11:53,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-08 06:11:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:11:53,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,633 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:11:53,633 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 666398374, now seen corresponding path program 1 times [2025-02-08 06:11:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023151946] [2025-02-08 06:11:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:11:53,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:11:53,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:53,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023151946] [2025-02-08 06:11:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023151946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:53,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:11:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085237692] [2025-02-08 06:11:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:53,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:11:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:53,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:11:53,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:11:53,759 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:53,833 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-02-08 06:11:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:11:53,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 06:11:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:53,834 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:11:53,834 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:11:53,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:11:53,835 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:53,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:11:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:11:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-08 06:11:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-02-08 06:11:53,837 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 26 [2025-02-08 06:11:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:53,837 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-02-08 06:11:53,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-02-08 06:11:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:11:53,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:53,837 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:53,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:11:53,838 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:53,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 692042114, now seen corresponding path program 1 times [2025-02-08 06:11:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905467160] [2025-02-08 06:11:53,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:11:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:11:53,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:53,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905467160] [2025-02-08 06:11:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905467160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550311345] [2025-02-08 06:11:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:53,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:53,968 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-08 06:11:53,970 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-08 06:11:54,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:11:54,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:11:54,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:54,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:54,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:11:54,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:54,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:54,210 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-08 06:11:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550311345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:54,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-08 06:11:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583149351] [2025-02-08 06:11:54,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:54,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:11:54,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:54,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:11:54,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:11:54,230 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:54,353 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2025-02-08 06:11:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:11:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 06:11:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:54,354 INFO L225 Difference]: With dead ends: 145 [2025-02-08 06:11:54,354 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 06:11:54,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:11:54,355 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:54,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 255 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 06:11:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 103. [2025-02-08 06:11:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2025-02-08 06:11:54,357 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 26 [2025-02-08 06:11:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:54,357 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2025-02-08 06:11:54,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2025-02-08 06:11:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:11:54,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:54,358 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:54,368 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-08 06:11:54,558 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,SelfDestructingSolverStorable22 [2025-02-08 06:11:54,559 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:54,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:54,559 INFO L85 PathProgramCache]: Analyzing trace with hash 599391621, now seen corresponding path program 1 times [2025-02-08 06:11:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26138711] [2025-02-08 06:11:54,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:54,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:11:54,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:11:54,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26138711] [2025-02-08 06:11:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26138711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:11:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:11:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 06:11:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601189035] [2025-02-08 06:11:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:11:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:11:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:54,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:11:54,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:11:54,731 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:54,811 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2025-02-08 06:11:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:11:54,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 06:11:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:54,811 INFO L225 Difference]: With dead ends: 136 [2025-02-08 06:11:54,812 INFO L226 Difference]: Without dead ends: 136 [2025-02-08 06:11:54,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:11:54,812 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:54,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-08 06:11:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2025-02-08 06:11:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.21) internal successors, (121), 103 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-02-08 06:11:54,814 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 26 [2025-02-08 06:11:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:54,814 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-02-08 06:11:54,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-02-08 06:11:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:11:54,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:54,817 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:54,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:11:54,817 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:54,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2019661338, now seen corresponding path program 1 times [2025-02-08 06:11:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099087806] [2025-02-08 06:11:54,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:54,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:11:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:11:54,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:54,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099087806] [2025-02-08 06:11:54,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099087806] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:54,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790702295] [2025-02-08 06:11:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:11:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:54,994 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-08 06:11:54,995 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-08 06:11:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:11:55,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:11:55,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:11:55,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:55,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:11:55,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:55,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:55,262 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-08 06:11:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790702295] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:55,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-02-08 06:11:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694503616] [2025-02-08 06:11:55,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:11:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:55,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:11:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:11:55,323 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:55,486 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2025-02-08 06:11:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:11:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 06:11:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:55,487 INFO L225 Difference]: With dead ends: 123 [2025-02-08 06:11:55,488 INFO L226 Difference]: Without dead ends: 123 [2025-02-08 06:11:55,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:11:55,489 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 102 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:55,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 297 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-08 06:11:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2025-02-08 06:11:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.17) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2025-02-08 06:11:55,491 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 29 [2025-02-08 06:11:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:55,491 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-02-08 06:11:55,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.590909090909091) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2025-02-08 06:11:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:11:55,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:55,492 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:55,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:11:55,694 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,SelfDestructingSolverStorable24 [2025-02-08 06:11:55,694 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:55,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 270542414, now seen corresponding path program 2 times [2025-02-08 06:11:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:55,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057882581] [2025-02-08 06:11:55,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:11:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:55,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:11:55,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:11:55,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:11:55,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057882581] [2025-02-08 06:11:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057882581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459005671] [2025-02-08 06:11:56,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:11:56,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:56,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:56,150 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-08 06:11:56,155 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-08 06:11:56,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:11:56,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:11:56,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:11:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:56,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:11:56,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:56,271 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-08 06:11:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:56,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:56,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:11:56,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:11:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:56,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459005671] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:56,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2025-02-08 06:11:56,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238426736] [2025-02-08 06:11:56,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 06:11:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:56,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 06:11:56,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:11:56,394 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:56,635 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2025-02-08 06:11:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:11:56,635 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 06:11:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:56,636 INFO L225 Difference]: With dead ends: 155 [2025-02-08 06:11:56,636 INFO L226 Difference]: Without dead ends: 155 [2025-02-08 06:11:56,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:11:56,637 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:56,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 516 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:11:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-08 06:11:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2025-02-08 06:11:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.1575342465753424) internal successors, (169), 147 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2025-02-08 06:11:56,640 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 36 [2025-02-08 06:11:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:56,640 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2025-02-08 06:11:56,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2025-02-08 06:11:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:11:56,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:56,640 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:56,649 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-08 06:11:56,845 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,SelfDestructingSolverStorable25 [2025-02-08 06:11:56,845 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:56,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1351259250, now seen corresponding path program 2 times [2025-02-08 06:11:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131679027] [2025-02-08 06:11:56,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:11:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:56,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 06:11:56,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:11:56,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:11:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:57,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131679027] [2025-02-08 06:11:57,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131679027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:57,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736720930] [2025-02-08 06:11:57,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:11:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:57,197 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-08 06:11:57,198 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-08 06:11:57,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 06:11:57,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:11:57,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:11:57,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:57,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 06:11:57,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:57,336 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-08 06:11:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:57,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:57,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:11:57,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:11:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736720930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:57,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 29 [2025-02-08 06:11:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065571465] [2025-02-08 06:11:57,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:57,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:11:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:57,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:11:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:11:57,655 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:57,790 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2025-02-08 06:11:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:11:57,791 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-08 06:11:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:57,792 INFO L225 Difference]: With dead ends: 240 [2025-02-08 06:11:57,792 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:11:57,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:11:57,793 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:57,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 382 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:11:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:11:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2025-02-08 06:11:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.1420765027322404) internal successors, (209), 184 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2025-02-08 06:11:57,800 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 38 [2025-02-08 06:11:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:57,801 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2025-02-08 06:11:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2025-02-08 06:11:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:11:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:57,801 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:57,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:11:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:58,002 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:58,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash -854241937, now seen corresponding path program 3 times [2025-02-08 06:11:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265192653] [2025-02-08 06:11:58,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:11:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:58,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:11:58,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:11:58,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:11:58,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265192653] [2025-02-08 06:11:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265192653] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246604088] [2025-02-08 06:11:58,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:11:58,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:58,216 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-08 06:11:58,217 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-08 06:11:58,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 3 equivalence classes. [2025-02-08 06:11:58,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:11:58,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:11:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:58,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:11:58,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:58,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:11:58,596 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-08 06:11:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:11:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246604088] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:11:58,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:11:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-02-08 06:11:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090817513] [2025-02-08 06:11:58,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:11:58,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:11:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:11:58,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:11:58,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:11:58,624 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:11:58,875 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2025-02-08 06:11:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:11:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-08 06:11:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:11:58,877 INFO L225 Difference]: With dead ends: 234 [2025-02-08 06:11:58,877 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 06:11:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:11:58,877 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 98 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:11:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 414 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:11:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 06:11:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 206. [2025-02-08 06:11:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 204 states have (on average 1.1470588235294117) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2025-02-08 06:11:58,885 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 39 [2025-02-08 06:11:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:11:58,885 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2025-02-08 06:11:58,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:11:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2025-02-08 06:11:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:11:58,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:11:58,885 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:11:58,900 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-08 06:11:59,086 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,SelfDestructingSolverStorable27 [2025-02-08 06:11:59,086 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:11:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:11:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1805566155, now seen corresponding path program 3 times [2025-02-08 06:11:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:11:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245019571] [2025-02-08 06:11:59,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:11:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:11:59,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-02-08 06:11:59,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:11:59,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:11:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:11:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:11:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245019571] [2025-02-08 06:11:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245019571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:11:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134993161] [2025-02-08 06:11:59,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:11:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:11:59,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:11:59,317 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-08 06:11:59,317 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-08 06:11:59,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-02-08 06:11:59,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:11:59,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:11:59,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:11:59,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 06:11:59,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:11:59,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-08 06:11:59,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-08 06:11:59,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-02-08 06:11:59,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:12:00,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:00,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-02-08 06:12:00,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-08 06:12:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:12:00,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:01,123 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 21 treesize of output 19 [2025-02-08 06:12:01,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 34 treesize of output 32 [2025-02-08 06:12:01,171 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 17 treesize of output 15 [2025-02-08 06:12:01,175 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 26 treesize of output 20 [2025-02-08 06:12:01,304 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:12:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:12:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134993161] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:01,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-02-08 06:12:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130585352] [2025-02-08 06:12:01,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:12:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:01,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:12:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 06:12:01,325 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 33 states, 32 states have (on average 3.5) internal successors, (112), 33 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:02,480 INFO L93 Difference]: Finished difference Result 366 states and 409 transitions. [2025-02-08 06:12:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 06:12:02,480 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5) internal successors, (112), 33 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-08 06:12:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:02,481 INFO L225 Difference]: With dead ends: 366 [2025-02-08 06:12:02,481 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 06:12:02,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:12:02,487 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 210 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:02,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 584 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:12:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 06:12:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2025-02-08 06:12:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 1.1439688715953307) internal successors, (294), 258 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 294 transitions. [2025-02-08 06:12:02,498 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 294 transitions. Word has length 41 [2025-02-08 06:12:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:02,498 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 294 transitions. [2025-02-08 06:12:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5) internal successors, (112), 33 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 294 transitions. [2025-02-08 06:12:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:12:02,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:02,498 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:02,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:02,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:12:02,699 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:02,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 473228965, now seen corresponding path program 4 times [2025-02-08 06:12:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119674869] [2025-02-08 06:12:02,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:02,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:02,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:02,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:02,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:03,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:03,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119674869] [2025-02-08 06:12:03,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119674869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:03,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288514586] [2025-02-08 06:12:03,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:03,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:03,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:03,097 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-08 06:12:03,101 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-08 06:12:03,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:12:03,174 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 46 statements. [2025-02-08 06:12:03,174 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:03,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:03,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:12:03,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:03,240 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-08 06:12:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:03,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:03,582 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-08 06:12:03,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:03,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 06:12:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288514586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:03,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-02-08 06:12:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639699209] [2025-02-08 06:12:03,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:12:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:03,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:12:03,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:12:03,702 INFO L87 Difference]: Start difference. First operand 259 states and 294 transitions. Second operand has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:04,122 INFO L93 Difference]: Finished difference Result 406 states and 454 transitions. [2025-02-08 06:12:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:12:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-08 06:12:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:04,123 INFO L225 Difference]: With dead ends: 406 [2025-02-08 06:12:04,123 INFO L226 Difference]: Without dead ends: 380 [2025-02-08 06:12:04,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=2379, Unknown=0, NotChecked=0, Total=2756 [2025-02-08 06:12:04,124 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:04,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 247 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-08 06:12:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 348. [2025-02-08 06:12:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 346 states have (on average 1.1473988439306357) internal successors, (397), 347 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 397 transitions. [2025-02-08 06:12:04,129 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 397 transitions. Word has length 46 [2025-02-08 06:12:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:04,129 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 397 transitions. [2025-02-08 06:12:04,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.264705882352941) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 397 transitions. [2025-02-08 06:12:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:12:04,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:04,130 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:04,138 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-08 06:12:04,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:04,330 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:04,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -207595386, now seen corresponding path program 5 times [2025-02-08 06:12:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:04,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94408718] [2025-02-08 06:12:04,331 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:04,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-02-08 06:12:04,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:12:04,343 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 06:12:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94408718] [2025-02-08 06:12:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94408718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177657888] [2025-02-08 06:12:04,543 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:04,546 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-08 06:12:04,562 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-08 06:12:04,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 4 equivalence classes. [2025-02-08 06:12:04,634 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:12:04,634 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 06:12:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:04,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 06:12:04,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:04,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:12:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:04,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177657888] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:05,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:05,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-02-08 06:12:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517231875] [2025-02-08 06:12:05,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:05,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:12:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:05,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:12:05,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:12:05,187 INFO L87 Difference]: Start difference. First operand 348 states and 397 transitions. Second operand has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:05,442 INFO L93 Difference]: Finished difference Result 421 states and 481 transitions. [2025-02-08 06:12:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:12:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 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-08 06:12:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:05,446 INFO L225 Difference]: With dead ends: 421 [2025-02-08 06:12:05,446 INFO L226 Difference]: Without dead ends: 421 [2025-02-08 06:12:05,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1191, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 06:12:05,447 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 142 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:05,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 554 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-08 06:12:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 376. [2025-02-08 06:12:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 1.1524064171122994) internal successors, (431), 375 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 431 transitions. [2025-02-08 06:12:05,460 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 431 transitions. Word has length 49 [2025-02-08 06:12:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:05,460 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 431 transitions. [2025-02-08 06:12:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.032258064516129) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 431 transitions. [2025-02-08 06:12:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 06:12:05,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:05,461 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:05,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:12:05,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-08 06:12:05,662 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:05,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 929688344, now seen corresponding path program 1 times [2025-02-08 06:12:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838838269] [2025-02-08 06:12:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:05,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:12:05,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:12:05,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:05,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838838269] [2025-02-08 06:12:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838838269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594477798] [2025-02-08 06:12:05,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:12:05,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:05,922 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:05,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:12:05,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 06:12:05,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 06:12:05,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:05,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 06:12:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:06,061 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-08 06:12:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:06,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:06,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594477798] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:06,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:06,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 24 [2025-02-08 06:12:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362967703] [2025-02-08 06:12:06,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:06,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:12:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:06,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:12:06,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:12:06,232 INFO L87 Difference]: Start difference. First operand 376 states and 431 transitions. Second operand has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:06,395 INFO L93 Difference]: Finished difference Result 607 states and 691 transitions. [2025-02-08 06:12:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:12:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 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 53 [2025-02-08 06:12:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:06,397 INFO L225 Difference]: With dead ends: 607 [2025-02-08 06:12:06,398 INFO L226 Difference]: Without dead ends: 469 [2025-02-08 06:12:06,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:12:06,398 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:06,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 627 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:12:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-08 06:12:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 430. [2025-02-08 06:12:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 428 states have (on average 1.158878504672897) internal successors, (496), 429 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 496 transitions. [2025-02-08 06:12:06,406 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 496 transitions. Word has length 53 [2025-02-08 06:12:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:06,406 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 496 transitions. [2025-02-08 06:12:06,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 24 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 496 transitions. [2025-02-08 06:12:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:12:06,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:06,410 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:06,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:06,614 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:06,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1787657298, now seen corresponding path program 6 times [2025-02-08 06:12:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:06,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309407288] [2025-02-08 06:12:06,615 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:06,621 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:06,643 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:06,643 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:06,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309407288] [2025-02-08 06:12:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309407288] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916580930] [2025-02-08 06:12:06,938 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:06,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:06,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:06,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:06,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:12:07,001 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-02-08 06:12:07,037 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:07,037 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-08 06:12:07,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:07,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 06:12:07,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:07,116 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-08 06:12:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:07,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:07,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:07,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916580930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:07,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 29 [2025-02-08 06:12:07,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048423981] [2025-02-08 06:12:07,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:07,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:12:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:07,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:12:07,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:12:07,292 INFO L87 Difference]: Start difference. First operand 430 states and 496 transitions. Second operand has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:07,709 INFO L93 Difference]: Finished difference Result 643 states and 735 transitions. [2025-02-08 06:12:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:12:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 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 56 [2025-02-08 06:12:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:07,714 INFO L225 Difference]: With dead ends: 643 [2025-02-08 06:12:07,714 INFO L226 Difference]: Without dead ends: 568 [2025-02-08 06:12:07,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 06:12:07,715 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:07,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 720 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-08 06:12:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 543. [2025-02-08 06:12:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 541 states have (on average 1.1626617375231054) internal successors, (629), 542 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 629 transitions. [2025-02-08 06:12:07,723 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 629 transitions. Word has length 56 [2025-02-08 06:12:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:07,723 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 629 transitions. [2025-02-08 06:12:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 629 transitions. [2025-02-08 06:12:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:12:07,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:07,724 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:07,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:12:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:07,928 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1994509031, now seen corresponding path program 2 times [2025-02-08 06:12:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:07,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228825780] [2025-02-08 06:12:07,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:07,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 06:12:07,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:07,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:07,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228825780] [2025-02-08 06:12:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228825780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676746051] [2025-02-08 06:12:08,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:08,168 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:08,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:12:08,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 06:12:08,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:12:08,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:08,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:08,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 06:12:08,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:08,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:08,640 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-08 06:12:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676746051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:08,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2025-02-08 06:12:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847377702] [2025-02-08 06:12:08,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:12:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:08,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:12:08,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:12:08,713 INFO L87 Difference]: Start difference. First operand 543 states and 629 transitions. Second operand has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:08,908 INFO L93 Difference]: Finished difference Result 793 states and 917 transitions. [2025-02-08 06:12:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:12:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-08 06:12:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:08,915 INFO L225 Difference]: With dead ends: 793 [2025-02-08 06:12:08,915 INFO L226 Difference]: Without dead ends: 793 [2025-02-08 06:12:08,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:12:08,916 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 67 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:08,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 460 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-02-08 06:12:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 671. [2025-02-08 06:12:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 669 states have (on average 1.1629297458893872) internal successors, (778), 670 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 778 transitions. [2025-02-08 06:12:08,935 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 778 transitions. Word has length 56 [2025-02-08 06:12:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:08,936 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 778 transitions. [2025-02-08 06:12:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 778 transitions. [2025-02-08 06:12:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:12:08,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:08,936 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:08,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-08 06:12:09,137 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:09,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 856019023, now seen corresponding path program 7 times [2025-02-08 06:12:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179412087] [2025-02-08 06:12:09,141 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:12:09,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:09,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:09,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179412087] [2025-02-08 06:12:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179412087] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180095590] [2025-02-08 06:12:09,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:12:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:09,575 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:09,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:12:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 06:12:09,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:12:09,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:12:09,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:09,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 06:12:09,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:09,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:10,052 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-08 06:12:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:10,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180095590] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:10,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:10,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-02-08 06:12:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288594787] [2025-02-08 06:12:10,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:12:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:10,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:12:10,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:12:10,119 INFO L87 Difference]: Start difference. First operand 671 states and 778 transitions. Second operand has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:10,567 INFO L93 Difference]: Finished difference Result 794 states and 920 transitions. [2025-02-08 06:12:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:12:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 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 59 [2025-02-08 06:12:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:10,569 INFO L225 Difference]: With dead ends: 794 [2025-02-08 06:12:10,569 INFO L226 Difference]: Without dead ends: 794 [2025-02-08 06:12:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 06:12:10,570 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 98 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:10,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 820 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-02-08 06:12:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 713. [2025-02-08 06:12:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 711 states have (on average 1.1673699015471168) internal successors, (830), 712 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 830 transitions. [2025-02-08 06:12:10,577 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 830 transitions. Word has length 59 [2025-02-08 06:12:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:10,578 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 830 transitions. [2025-02-08 06:12:10,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 830 transitions. [2025-02-08 06:12:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 06:12:10,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:10,578 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:10,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:12:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-08 06:12:10,779 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1712678853, now seen corresponding path program 8 times [2025-02-08 06:12:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095189656] [2025-02-08 06:12:10,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:10,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:12:10,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:10,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095189656] [2025-02-08 06:12:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095189656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337044081] [2025-02-08 06:12:11,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:12:11,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:11,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:11,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:11,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:12:11,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-08 06:12:11,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 06:12:11,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:12:11,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:11,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 06:12:11,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:11,343 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-08 06:12:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:11,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:11,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:11,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337044081] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:11,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-02-08 06:12:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758235959] [2025-02-08 06:12:11,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 06:12:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 06:12:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-02-08 06:12:11,519 INFO L87 Difference]: Start difference. First operand 713 states and 830 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:12,040 INFO L93 Difference]: Finished difference Result 1017 states and 1176 transitions. [2025-02-08 06:12:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:12:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 06:12:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:12,043 INFO L225 Difference]: With dead ends: 1017 [2025-02-08 06:12:12,043 INFO L226 Difference]: Without dead ends: 926 [2025-02-08 06:12:12,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1962, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:12:12,044 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 144 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:12,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 929 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-02-08 06:12:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 887. [2025-02-08 06:12:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 885 states have (on average 1.1728813559322033) internal successors, (1038), 886 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1038 transitions. [2025-02-08 06:12:12,060 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1038 transitions. Word has length 66 [2025-02-08 06:12:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:12,060 INFO L471 AbstractCegarLoop]: Abstraction has 887 states and 1038 transitions. [2025-02-08 06:12:12,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1038 transitions. [2025-02-08 06:12:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 06:12:12,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:12,063 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:12,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:12:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:12,267 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:12,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -709083995, now seen corresponding path program 3 times [2025-02-08 06:12:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394802815] [2025-02-08 06:12:12,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:12,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 5 equivalence classes. [2025-02-08 06:12:12,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:12:12,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 06:12:12,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394802815] [2025-02-08 06:12:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394802815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807625224] [2025-02-08 06:12:12,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:12,653 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:12,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:12:12,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 5 equivalence classes. [2025-02-08 06:12:12,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 06:12:12,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-08 06:12:12,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:12,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 06:12:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:12,824 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-08 06:12:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 35 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:12,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:12,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:12:12,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:12:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807625224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:13,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 27 [2025-02-08 06:12:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889518119] [2025-02-08 06:12:13,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:13,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:12:13,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:12:13,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:12:13,013 INFO L87 Difference]: Start difference. First operand 887 states and 1038 transitions. Second operand has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:13,226 INFO L93 Difference]: Finished difference Result 1472 states and 1714 transitions. [2025-02-08 06:12:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:12:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-08 06:12:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:13,228 INFO L225 Difference]: With dead ends: 1472 [2025-02-08 06:12:13,228 INFO L226 Difference]: Without dead ends: 1046 [2025-02-08 06:12:13,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:12:13,229 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 35 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:13,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 876 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:12:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-08 06:12:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 954. [2025-02-08 06:12:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 952 states have (on average 1.1743697478991597) internal successors, (1118), 953 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1118 transitions. [2025-02-08 06:12:13,239 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1118 transitions. Word has length 68 [2025-02-08 06:12:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1118 transitions. [2025-02-08 06:12:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1118 transitions. [2025-02-08 06:12:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 06:12:13,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:13,240 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:13,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:13,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:13,444 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:13,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:13,445 INFO L85 PathProgramCache]: Analyzing trace with hash -254927066, now seen corresponding path program 9 times [2025-02-08 06:12:13,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:13,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947471127] [2025-02-08 06:12:13,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:13,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-02-08 06:12:13,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:13,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:12:13,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947471127] [2025-02-08 06:12:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947471127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390274467] [2025-02-08 06:12:13,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:12:13,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:13,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:13,796 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:13,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:12:13,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 6 equivalence classes. [2025-02-08 06:12:13,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 06:12:13,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-08 06:12:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:13,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 06:12:13,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:14,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:14,305 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-08 06:12:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390274467] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:14,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2025-02-08 06:12:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611139819] [2025-02-08 06:12:14,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:12:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:14,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:12:14,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:12:14,370 INFO L87 Difference]: Start difference. First operand 954 states and 1118 transitions. Second operand has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:14,717 INFO L93 Difference]: Finished difference Result 1111 states and 1298 transitions. [2025-02-08 06:12:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:12:14,717 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 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 69 [2025-02-08 06:12:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:14,719 INFO L225 Difference]: With dead ends: 1111 [2025-02-08 06:12:14,719 INFO L226 Difference]: Without dead ends: 1111 [2025-02-08 06:12:14,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:12:14,720 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 269 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:14,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 576 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:12:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-02-08 06:12:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1003. [2025-02-08 06:12:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1001 states have (on average 1.1778221778221778) internal successors, (1179), 1002 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1179 transitions. [2025-02-08 06:12:14,736 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1179 transitions. Word has length 69 [2025-02-08 06:12:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:14,736 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1179 transitions. [2025-02-08 06:12:14,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.257142857142857) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1179 transitions. [2025-02-08 06:12:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 06:12:14,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:14,737 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:14,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 06:12:14,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 06:12:14,938 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:14,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1899794564, now seen corresponding path program 4 times [2025-02-08 06:12:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193787638] [2025-02-08 06:12:14,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:14,945 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-02-08 06:12:14,961 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 71 statements. [2025-02-08 06:12:14,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:14,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 7 proven. 80 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 06:12:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193787638] [2025-02-08 06:12:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193787638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457369243] [2025-02-08 06:12:16,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:16,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:16,345 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:16,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 06:12:16,429 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-02-08 06:12:16,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 71 statements. [2025-02-08 06:12:16,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:16,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:16,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-08 06:12:16,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:16,474 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-08 06:12:19,849 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-02-08 06:12:19,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 51 [2025-02-08 06:12:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 48 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:12:20,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:21,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2025-02-08 06:12:21,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2025-02-08 06:12:21,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:12:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:12:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457369243] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:21,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 35, 26] total 74 [2025-02-08 06:12:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156918489] [2025-02-08 06:12:21,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-02-08 06:12:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-02-08 06:12:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=4553, Unknown=0, NotChecked=0, Total=5550 [2025-02-08 06:12:21,825 INFO L87 Difference]: Start difference. First operand 1003 states and 1179 transitions. Second operand has 75 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 75 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:30,629 INFO L93 Difference]: Finished difference Result 3166 states and 3685 transitions. [2025-02-08 06:12:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-02-08 06:12:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 75 states have internal predecessors, (169), 0 states have call successors, (0), 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 71 [2025-02-08 06:12:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:30,632 INFO L225 Difference]: With dead ends: 3166 [2025-02-08 06:12:30,632 INFO L226 Difference]: Without dead ends: 1363 [2025-02-08 06:12:30,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8284 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=6002, Invalid=21720, Unknown=0, NotChecked=0, Total=27722 [2025-02-08 06:12:30,637 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 248 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:30,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 626 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 06:12:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-08 06:12:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 299. [2025-02-08 06:12:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.1610738255033557) internal successors, (346), 298 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 346 transitions. [2025-02-08 06:12:30,643 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 346 transitions. Word has length 71 [2025-02-08 06:12:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:30,643 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 346 transitions. [2025-02-08 06:12:30,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.2837837837837838) internal successors, (169), 75 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 346 transitions. [2025-02-08 06:12:30,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 06:12:30,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:30,644 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:30,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:30,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:30,848 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:30,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash -250214130, now seen corresponding path program 10 times [2025-02-08 06:12:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817990645] [2025-02-08 06:12:30,848 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:30,856 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-08 06:12:30,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-02-08 06:12:30,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817990645] [2025-02-08 06:12:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817990645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135348107] [2025-02-08 06:12:32,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:12:32,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:32,089 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:32,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 06:12:32,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 76 statements into 2 equivalence classes. [2025-02-08 06:12:32,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 62 of 76 statements. [2025-02-08 06:12:32,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:12:32,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:32,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-08 06:12:32,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:32,408 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-08 06:12:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 107 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:33,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:33,803 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 89 treesize of output 77 [2025-02-08 06:12:33,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:33,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-02-08 06:12:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135348107] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:34,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-02-08 06:12:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816680457] [2025-02-08 06:12:34,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-02-08 06:12:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:34,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-02-08 06:12:34,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=3859, Unknown=0, NotChecked=0, Total=4422 [2025-02-08 06:12:34,268 INFO L87 Difference]: Start difference. First operand 299 states and 346 transitions. Second operand has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:35,574 INFO L93 Difference]: Finished difference Result 561 states and 641 transitions. [2025-02-08 06:12:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-08 06:12:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 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 76 [2025-02-08 06:12:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:35,575 INFO L225 Difference]: With dead ends: 561 [2025-02-08 06:12:35,575 INFO L226 Difference]: Without dead ends: 319 [2025-02-08 06:12:35,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1291, Invalid=8809, Unknown=0, NotChecked=0, Total=10100 [2025-02-08 06:12:35,576 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:35,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 495 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:12:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-08 06:12:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 311. [2025-02-08 06:12:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 1.1548387096774193) internal successors, (358), 310 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 358 transitions. [2025-02-08 06:12:35,584 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 358 transitions. Word has length 76 [2025-02-08 06:12:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:35,584 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 358 transitions. [2025-02-08 06:12:35,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 67 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 358 transitions. [2025-02-08 06:12:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:12:35,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:35,585 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:35,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 06:12:35,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-08 06:12:35,785 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1547549487, now seen corresponding path program 11 times [2025-02-08 06:12:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360050331] [2025-02-08 06:12:35,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:35,800 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-02-08 06:12:35,810 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:12:35,810 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-08 06:12:35,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:36,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360050331] [2025-02-08 06:12:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360050331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:36,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113083291] [2025-02-08 06:12:36,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 06:12:36,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:36,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:36,156 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:36,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 06:12:36,239 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 79 statements into 7 equivalence classes. [2025-02-08 06:12:36,281 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:12:36,281 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-08 06:12:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:36,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 06:12:36,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:36,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:12:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113083291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:36,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2025-02-08 06:12:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485762789] [2025-02-08 06:12:36,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 06:12:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:36,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 06:12:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:12:36,993 INFO L87 Difference]: Start difference. First operand 311 states and 358 transitions. Second operand has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:12:37,572 INFO L93 Difference]: Finished difference Result 401 states and 460 transitions. [2025-02-08 06:12:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:12:37,573 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 0 states have call successors, (0), 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 79 [2025-02-08 06:12:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:12:37,574 INFO L225 Difference]: With dead ends: 401 [2025-02-08 06:12:37,574 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 06:12:37,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=419, Invalid=2661, Unknown=0, NotChecked=0, Total=3080 [2025-02-08 06:12:37,574 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 209 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:12:37,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 960 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:12:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 06:12:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 339. [2025-02-08 06:12:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.1597633136094674) internal successors, (392), 338 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 392 transitions. [2025-02-08 06:12:37,580 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 392 transitions. Word has length 79 [2025-02-08 06:12:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:12:37,580 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 392 transitions. [2025-02-08 06:12:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.217391304347826) internal successors, (194), 47 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:12:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 392 transitions. [2025-02-08 06:12:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-08 06:12:37,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:12:37,581 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:12:37,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-08 06:12:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-08 06:12:37,783 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:12:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:12:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2030665957, now seen corresponding path program 12 times [2025-02-08 06:12:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:12:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958603827] [2025-02-08 06:12:37,783 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:12:37,794 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-02-08 06:12:37,822 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:12:37,823 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:12:37,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 32 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:12:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:12:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958603827] [2025-02-08 06:12:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958603827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:12:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759351168] [2025-02-08 06:12:39,545 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 06:12:39,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:12:39,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:12:39,548 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:12:39,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-08 06:12:39,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 86 statements into 8 equivalence classes. [2025-02-08 06:12:39,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 06:12:39,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-08 06:12:39,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:12:39,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 06:12:39,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:12:39,901 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-08 06:12:44,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:12:44,781 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-08 06:12:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:44,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:12:46,073 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-08 06:12:46,076 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-08 06:12:46,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 06:12:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:12:46,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759351168] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:12:46,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:12:46,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 21] total 62 [2025-02-08 06:12:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111267838] [2025-02-08 06:12:46,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:12:46,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-08 06:12:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:12:46,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-08 06:12:46,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3538, Unknown=0, NotChecked=0, Total=3782 [2025-02-08 06:12:46,222 INFO L87 Difference]: Start difference. First operand 339 states and 392 transitions. Second operand has 62 states, 62 states have (on average 3.693548387096774) internal successors, (229), 62 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:13,815 INFO L93 Difference]: Finished difference Result 497 states and 562 transitions. [2025-02-08 06:13:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-02-08 06:13:13,820 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 3.693548387096774) internal successors, (229), 62 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-02-08 06:13:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:13,820 INFO L225 Difference]: With dead ends: 497 [2025-02-08 06:13:13,820 INFO L226 Difference]: Without dead ends: 443 [2025-02-08 06:13:13,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 132 SyntacticMatches, 7 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3356 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=1209, Invalid=11446, Unknown=1, NotChecked=0, Total=12656 [2025-02-08 06:13:13,825 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 782 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:13,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 921 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 06:13:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-08 06:13:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 370. [2025-02-08 06:13:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.1626016260162602) internal successors, (429), 369 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 429 transitions. [2025-02-08 06:13:13,833 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 429 transitions. Word has length 86 [2025-02-08 06:13:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 429 transitions. [2025-02-08 06:13:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.693548387096774) internal successors, (229), 62 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 429 transitions. [2025-02-08 06:13:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:13:13,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:13,834 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:13,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-08 06:13:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-02-08 06:13:14,034 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1052985746, now seen corresponding path program 13 times [2025-02-08 06:13:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041072090] [2025-02-08 06:13:14,035 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:14,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:13:14,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:14,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:14,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041072090] [2025-02-08 06:13:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041072090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921668027] [2025-02-08 06:13:14,675 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 06:13:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:14,677 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:14,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 06:13:14,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 06:13:14,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:14,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:13:14,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:14,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-08 06:13:14,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:14,979 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-08 06:13:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:15,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:15,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:13:15,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:13:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921668027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:15,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-02-08 06:13:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122363002] [2025-02-08 06:13:15,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:13:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:15,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:13:15,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 06:13:15,243 INFO L87 Difference]: Start difference. First operand 370 states and 429 transitions. Second operand has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:16,301 INFO L93 Difference]: Finished difference Result 694 states and 801 transitions. [2025-02-08 06:13:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-08 06:13:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-08 06:13:16,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:16,302 INFO L225 Difference]: With dead ends: 694 [2025-02-08 06:13:16,302 INFO L226 Difference]: Without dead ends: 399 [2025-02-08 06:13:16,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=3879, Unknown=0, NotChecked=0, Total=4160 [2025-02-08 06:13:16,303 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 224 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:16,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1248 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:13:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-08 06:13:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 391. [2025-02-08 06:13:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.1615384615384616) internal successors, (453), 390 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 453 transitions. [2025-02-08 06:13:16,308 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 453 transitions. Word has length 96 [2025-02-08 06:13:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:16,309 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 453 transitions. [2025-02-08 06:13:16,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.55) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 453 transitions. [2025-02-08 06:13:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:13:16,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:16,309 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:16,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-08 06:13:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:16,514 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash -96569488, now seen corresponding path program 14 times [2025-02-08 06:13:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349527028] [2025-02-08 06:13:16,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:16,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 06:13:16,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:16,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:16,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 263 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:13:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349527028] [2025-02-08 06:13:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349527028] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:17,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820217332] [2025-02-08 06:13:17,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:13:17,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:17,590 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:17,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-08 06:13:17,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 06:13:17,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:13:17,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:13:17,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:17,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-02-08 06:13:17,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:17,967 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-08 06:13:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 78 proven. 180 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:13:18,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:18,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-08 06:13:18,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-08 06:13:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 78 proven. 180 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:13:18,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820217332] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:18,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:18,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 46 [2025-02-08 06:13:18,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111882024] [2025-02-08 06:13:18,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:18,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 06:13:18,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:18,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 06:13:18,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1968, Unknown=0, NotChecked=0, Total=2070 [2025-02-08 06:13:18,544 INFO L87 Difference]: Start difference. First operand 391 states and 453 transitions. Second operand has 46 states, 46 states have (on average 3.9782608695652173) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:13:20,890 INFO L93 Difference]: Finished difference Result 649 states and 746 transitions. [2025-02-08 06:13:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:13:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.9782608695652173) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 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 96 [2025-02-08 06:13:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:13:20,891 INFO L225 Difference]: With dead ends: 649 [2025-02-08 06:13:20,891 INFO L226 Difference]: Without dead ends: 391 [2025-02-08 06:13:20,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=374, Invalid=5478, Unknown=0, NotChecked=0, Total=5852 [2025-02-08 06:13:20,892 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 243 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:13:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1455 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:13:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-08 06:13:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-02-08 06:13:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.1538461538461537) internal successors, (450), 390 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 450 transitions. [2025-02-08 06:13:20,896 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 450 transitions. Word has length 96 [2025-02-08 06:13:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:13:20,896 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 450 transitions. [2025-02-08 06:13:20,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.9782608695652173) internal successors, (183), 46 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:13:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 450 transitions. [2025-02-08 06:13:20,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-08 06:13:20,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:13:20,897 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:13:20,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-02-08 06:13:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-02-08 06:13:21,098 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 06:13:21,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:13:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 223284751, now seen corresponding path program 15 times [2025-02-08 06:13:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:13:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868879261] [2025-02-08 06:13:21,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:13:21,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 9 equivalence classes. [2025-02-08 06:13:21,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 06:13:21,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 06:13:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 51 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:13:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868879261] [2025-02-08 06:13:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868879261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:13:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141071800] [2025-02-08 06:13:22,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:13:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:13:22,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:13:22,063 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:13:22,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-08 06:13:22,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 9 equivalence classes. [2025-02-08 06:13:22,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 06:13:22,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-08 06:13:22,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:13:22,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 06:13:22,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:13:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:22,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:13:23,031 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-08 06:13:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:13:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141071800] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:13:23,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:13:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 47 [2025-02-08 06:13:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446126108] [2025-02-08 06:13:23,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:13:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 06:13:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:13:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 06:13:23,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1944, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:13:23,187 INFO L87 Difference]: Start difference. First operand 391 states and 450 transitions. Second operand has 48 states, 47 states have (on average 4.446808510638298) internal successors, (209), 48 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)