./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/960521-1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/960521-1-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:14:51,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:14:51,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:14:51,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:14:51,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:14:51,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:14:51,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:14:51,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:14:51,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:14:51,950 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:14:51,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:14:51,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:14:51,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:14:51,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:14:51,952 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:14:51,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:14:51,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:14:51,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:14:51,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:14:51,953 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:14:51,954 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:14:51,954 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:14:51,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:14:51,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:14:51,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:14:51,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:14:51,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:14:51,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:14:51,955 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 -> 19e2947f690bcfa099d607c2a0a6dc0e6f351f54e3f3874a42109cbf9e336957 [2025-02-06 10:14:52,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:14:52,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:14:52,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:14:52,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:14:52,271 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:14:52,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/960521-1-2.i [2025-02-06 10:14:53,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bdfb0ef2/5b4eb3538db14d309386183538fe081f/FLAG1219f7ce7 [2025-02-06 10:14:53,980 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:14:53,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/960521-1-2.i [2025-02-06 10:14:54,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bdfb0ef2/5b4eb3538db14d309386183538fe081f/FLAG1219f7ce7 [2025-02-06 10:14:54,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bdfb0ef2/5b4eb3538db14d309386183538fe081f [2025-02-06 10:14:54,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:14:54,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:14:54,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:14:54,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:14:54,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:14:54,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24db02ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54, skipping insertion in model container [2025-02-06 10:14:54,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:14:54,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:14:54,350 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:14:54,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:14:54,428 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:14:54,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54 WrapperNode [2025-02-06 10:14:54,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:14:54,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:14:54,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:14:54,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:14:54,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,472 INFO L138 Inliner]: procedures = 121, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-02-06 10:14:54,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:14:54,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:14:54,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:14:54,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:14:54,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,506 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-02-06 10:14:54,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,514 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:14:54,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:14:54,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:14:54,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:14:54,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (1/1) ... [2025-02-06 10:14:54,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:14:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:54,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:14:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:14:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:14:54,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:14:54,703 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:14:54,705 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:14:54,856 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 10:14:54,856 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:14:54,865 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:14:54,865 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:14:54,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:14:54 BoogieIcfgContainer [2025-02-06 10:14:54,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:14:54,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:14:54,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:14:54,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:14:54,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:14:54" (1/3) ... [2025-02-06 10:14:54,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adaebd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:14:54, skipping insertion in model container [2025-02-06 10:14:54,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:14:54" (2/3) ... [2025-02-06 10:14:54,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adaebd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:14:54, skipping insertion in model container [2025-02-06 10:14:54,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:14:54" (3/3) ... [2025-02-06 10:14:54,880 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1-2.i [2025-02-06 10:14:54,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:14:54,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1-2.i that has 1 procedures, 50 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-02-06 10:14:54,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:14:54,953 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;@36eb0b1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:14:54,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 10:14:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:14:54,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:54,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:14:54,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 80400, now seen corresponding path program 1 times [2025-02-06 10:14:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:54,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206784579] [2025-02-06 10:14:54,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:14:55,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:14:55,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:55,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:55,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206784579] [2025-02-06 10:14:55,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206784579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:55,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:55,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:55,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207028858] [2025-02-06 10:14:55,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:55,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:55,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:55,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:55,241 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:55,300 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-02-06 10:14:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:14:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:55,307 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:14:55,308 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:14:55,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:55,313 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:55,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:14:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:14:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-02-06 10:14:55,344 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2025-02-06 10:14:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:55,344 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-02-06 10:14:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-02-06 10:14:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:14:55,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:55,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:14:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:14:55,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 80401, now seen corresponding path program 1 times [2025-02-06 10:14:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436279267] [2025-02-06 10:14:55,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:55,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:14:55,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:14:55,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:55,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:55,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436279267] [2025-02-06 10:14:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436279267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:55,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:14:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525890632] [2025-02-06 10:14:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:55,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:14:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:55,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:14:55,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:55,531 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:55,558 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-02-06 10:14:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:55,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-06 10:14:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:55,560 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:14:55,561 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:14:55,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:14:55,561 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:55,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:14:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:14:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-02-06 10:14:55,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 3 [2025-02-06 10:14:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:55,569 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-02-06 10:14:55,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-02-06 10:14:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:14:55,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:55,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:14:55,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:14:55,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:55,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755043, now seen corresponding path program 1 times [2025-02-06 10:14:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585413399] [2025-02-06 10:14:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:55,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:14:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:14:55,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:55,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:55,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585413399] [2025-02-06 10:14:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585413399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:55,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:14:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810076902] [2025-02-06 10:14:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:14:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:14:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:55,684 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:55,737 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-02-06 10:14:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:14:55,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:14:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:55,738 INFO L225 Difference]: With dead ends: 43 [2025-02-06 10:14:55,738 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 10:14:55,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:55,739 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:55,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 10:14:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 10:14:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-02-06 10:14:55,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 6 [2025-02-06 10:14:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-02-06 10:14:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-02-06 10:14:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:14:55,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:55,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:14:55,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:14:55,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:55,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1899755042, now seen corresponding path program 1 times [2025-02-06 10:14:55,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:55,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408513735] [2025-02-06 10:14:55,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:55,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:14:55,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:14:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:55,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:55,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408513735] [2025-02-06 10:14:55,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408513735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:55,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:55,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:55,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960423160] [2025-02-06 10:14:55,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:55,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:14:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:55,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:14:55,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:14:55,999 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:56,124 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-06 10:14:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:14:56,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:14:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:56,127 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:14:56,127 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:14:56,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:14:56,128 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:56,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 61 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:14:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-02-06 10:14:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-06 10:14:56,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 6 [2025-02-06 10:14:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:56,133 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-06 10:14:56,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-06 10:14:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:14:56,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:56,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:56,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:14:56,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1237130887, now seen corresponding path program 1 times [2025-02-06 10:14:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519124333] [2025-02-06 10:14:56,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:14:56,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:14:56,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:56,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519124333] [2025-02-06 10:14:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519124333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:14:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:14:56,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:14:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080820566] [2025-02-06 10:14:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:14:56,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:14:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:56,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:14:56,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:56,191 INFO L87 Difference]: Start difference. First operand 44 states and 47 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-06 10:14:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:56,227 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-02-06 10:14:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:14:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:14:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:56,229 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:14:56,229 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:14:56,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:14:56,231 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:56,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:14:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:14:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-02-06 10:14:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 43 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-02-06 10:14:56,235 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 7 [2025-02-06 10:14:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:56,235 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-02-06 10:14:56,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-02-06 10:14:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:14:56,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:56,238 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:14:56,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:56,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -818415572, now seen corresponding path program 1 times [2025-02-06 10:14:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687866050] [2025-02-06 10:14:56,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:56,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:56,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:14:56,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:14:56,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:56,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687866050] [2025-02-06 10:14:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687866050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086209860] [2025-02-06 10:14:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:56,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:56,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:56,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:14:56,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:14:56,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:14:56,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:56,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:56,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:14:56,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:56,745 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:14:56,745 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-02-06 10:14:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:56,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:57,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086209860] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:57,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:57,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-02-06 10:14:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312235426] [2025-02-06 10:14:57,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:57,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:14:57,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:57,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:14:57,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:14:57,088 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:57,442 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-02-06 10:14:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:14:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:14:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:57,443 INFO L225 Difference]: With dead ends: 61 [2025-02-06 10:14:57,443 INFO L226 Difference]: Without dead ends: 61 [2025-02-06 10:14:57,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:14:57,444 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:57,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 101 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:14:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-06 10:14:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-02-06 10:14:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-02-06 10:14:57,448 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2025-02-06 10:14:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:57,448 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-02-06 10:14:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-02-06 10:14:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:14:57,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:57,449 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 10:14:57,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:14:57,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:57,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1876917154, now seen corresponding path program 2 times [2025-02-06 10:14:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194419107] [2025-02-06 10:14:57,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:14:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:57,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 10:14:57,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:14:57,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:14:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:14:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194419107] [2025-02-06 10:14:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194419107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:14:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72574805] [2025-02-06 10:14:58,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:14:58,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:14:58,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:14:58,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:14:58,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 10:14:58,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:14:58,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:14:58,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:14:58,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:14:58,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:14:58,269 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:14:58,270 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 1 case distinctions, treesize of input 9 treesize of output 11 [2025-02-06 10:14:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:58,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:14:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:14:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72574805] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:14:59,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:14:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-06 10:14:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966097828] [2025-02-06 10:14:59,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:14:59,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 10:14:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:14:59,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 10:14:59,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2025-02-06 10:14:59,246 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:14:59,734 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2025-02-06 10:14:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:14:59,735 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:14:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:14:59,737 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:14:59,737 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:14:59,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=700, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:14:59,738 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 218 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:14:59,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 183 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:14:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:14:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-02-06 10:14:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-02-06 10:14:59,745 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-02-06 10:14:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:14:59,745 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-02-06 10:14:59,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:14:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-02-06 10:14:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:14:59,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:14:59,746 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:14:59,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:14:59,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:14:59,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:14:59,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:14:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573895, now seen corresponding path program 1 times [2025-02-06 10:14:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:14:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202553618] [2025-02-06 10:14:59,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:14:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:14:59,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:14:59,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:14:59,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:14:59,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 10:15:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202553618] [2025-02-06 10:15:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202553618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:15:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:15:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:15:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767898200] [2025-02-06 10:15:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:15:00,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:15:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:00,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:15:00,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:15:00,018 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:00,062 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-02-06 10:15:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:15:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:15:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:00,063 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:15:00,063 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 10:15:00,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:15:00,064 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:00,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:15:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 10:15:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 10:15:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-02-06 10:15:00,068 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 25 [2025-02-06 10:15:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:00,070 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-02-06 10:15:00,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,070 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-02-06 10:15:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:15:00,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:00,071 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:00,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:15:00,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:00,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1140573896, now seen corresponding path program 1 times [2025-02-06 10:15:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140795968] [2025-02-06 10:15:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:00,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:15:00,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:15:00,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:00,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140795968] [2025-02-06 10:15:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140795968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386127235] [2025-02-06 10:15:00,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:00,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:00,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:00,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:15:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:15:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:15:00,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:00,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:15:00,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:00,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:15:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386127235] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:00,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-02-06 10:15:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034097039] [2025-02-06 10:15:00,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:15:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:00,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:15:00,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:15:00,555 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:00,841 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2025-02-06 10:15:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:15:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:15:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:00,843 INFO L225 Difference]: With dead ends: 115 [2025-02-06 10:15:00,843 INFO L226 Difference]: Without dead ends: 115 [2025-02-06 10:15:00,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=392, Invalid=600, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:15:00,845 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 181 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:00,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 166 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:15:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-06 10:15:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2025-02-06 10:15:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2025-02-06 10:15:00,855 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 25 [2025-02-06 10:15:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:00,855 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2025-02-06 10:15:00,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2025-02-06 10:15:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:15:00,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:00,858 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:00,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:15:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:01,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2014809656, now seen corresponding path program 2 times [2025-02-06 10:15:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011673295] [2025-02-06 10:15:01,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:15:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:01,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-06 10:15:01,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 49 statements. [2025-02-06 10:15:01,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:15:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-06 10:15:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:01,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011673295] [2025-02-06 10:15:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011673295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:15:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:15:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:15:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705770220] [2025-02-06 10:15:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:15:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:15:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:01,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:15:01,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:15:01,203 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.5) 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-06 10:15:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:01,291 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-02-06 10:15:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:15:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) 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 49 [2025-02-06 10:15:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:01,292 INFO L225 Difference]: With dead ends: 92 [2025-02-06 10:15:01,292 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 10:15:01,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:15:01,292 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:01,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:15:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 10:15:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-06 10:15:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-02-06 10:15:01,297 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 49 [2025-02-06 10:15:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:01,297 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-02-06 10:15:01,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) 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-06 10:15:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-02-06 10:15:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:15:01,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:01,298 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:01,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:15:01,299 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:01,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1026525989, now seen corresponding path program 1 times [2025-02-06 10:15:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321102590] [2025-02-06 10:15:01,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:01,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:15:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:15:01,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:15:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321102590] [2025-02-06 10:15:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321102590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325967339] [2025-02-06 10:15:01,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:01,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:01,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:01,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:01,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:15:01,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 10:15:01,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 10:15:01,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:01,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:01,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:15:01,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:15:02,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:15:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325967339] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:02,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:02,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-02-06 10:15:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934346965] [2025-02-06 10:15:02,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:15:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:15:02,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 10:15:02,558 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:03,204 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2025-02-06 10:15:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:15:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-06 10:15:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:03,205 INFO L225 Difference]: With dead ends: 206 [2025-02-06 10:15:03,205 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 10:15:03,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 10:15:03,208 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 533 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 88 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:15:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 10:15:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 164. [2025-02-06 10:15:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 156 states have (on average 1.141025641025641) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2025-02-06 10:15:03,223 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 52 [2025-02-06 10:15:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:03,223 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2025-02-06 10:15:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.877551020408163) internal successors, (141), 49 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2025-02-06 10:15:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 10:15:03,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:03,225 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:03,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:15:03,425 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,SelfDestructingSolverStorable10 [2025-02-06 10:15:03,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -419275045, now seen corresponding path program 2 times [2025-02-06 10:15:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771208705] [2025-02-06 10:15:03,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:15:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:03,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-06 10:15:03,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 10:15:03,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:15:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-02-06 10:15:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771208705] [2025-02-06 10:15:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771208705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709315000] [2025-02-06 10:15:04,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:15:04,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:04,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:04,074 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:04,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:15:04,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-06 10:15:04,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 10:15:04,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:15:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:04,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:15:04,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:15:05,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:15:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709315000] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:06,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 34, 34] total 71 [2025-02-06 10:15:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524885644] [2025-02-06 10:15:06,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:06,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-02-06 10:15:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:06,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-02-06 10:15:06,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=2870, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 10:15:06,158 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:12,430 INFO L93 Difference]: Finished difference Result 397 states and 428 transitions. [2025-02-06 10:15:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-06 10:15:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 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 100 [2025-02-06 10:15:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:12,433 INFO L225 Difference]: With dead ends: 397 [2025-02-06 10:15:12,433 INFO L226 Difference]: Without dead ends: 397 [2025-02-06 10:15:12,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6458 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8917, Invalid=17815, Unknown=0, NotChecked=0, Total=26732 [2025-02-06 10:15:12,440 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1046 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:12,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 101 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:15:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-06 10:15:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 307. [2025-02-06 10:15:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 300 states have (on average 1.0266666666666666) internal successors, (308), 306 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2025-02-06 10:15:12,451 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 100 [2025-02-06 10:15:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:12,452 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2025-02-06 10:15:12,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 71 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2025-02-06 10:15:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-02-06 10:15:12,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:12,456 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:12,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:15:12,656 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,SelfDestructingSolverStorable11 [2025-02-06 10:15:12,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:12,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1046795783, now seen corresponding path program 1 times [2025-02-06 10:15:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785547542] [2025-02-06 10:15:12,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-02-06 10:15:12,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-02-06 10:15:12,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:12,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7161 trivial. 0 not checked. [2025-02-06 10:15:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785547542] [2025-02-06 10:15:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785547542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:15:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:15:12,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:15:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186383267] [2025-02-06 10:15:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:15:12,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:15:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:12,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:15:12,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:15:12,942 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:12,955 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2025-02-06 10:15:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:15:12,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2025-02-06 10:15:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:12,957 INFO L225 Difference]: With dead ends: 305 [2025-02-06 10:15:12,957 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 10:15:12,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:15:12,958 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:12,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:15:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 10:15:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-06 10:15:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 300 states have (on average 1.02) internal successors, (306), 304 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2025-02-06 10:15:12,972 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 290 [2025-02-06 10:15:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2025-02-06 10:15:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2025-02-06 10:15:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-06 10:15:12,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:12,978 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:12,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:15:12,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 948399557, now seen corresponding path program 1 times [2025-02-06 10:15:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708338890] [2025-02-06 10:15:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:12,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:13,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-06 10:15:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-06 10:15:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-02-06 10:15:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708338890] [2025-02-06 10:15:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708338890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349582943] [2025-02-06 10:15:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:15:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:17,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:17,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:15:17,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-06 10:15:17,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-06 10:15:17,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:15:17,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:17,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-06 10:15:17,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-02-06 10:15:19,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-02-06 10:15:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349582943] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:24,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 193 [2025-02-06 10:15:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099913604] [2025-02-06 10:15:24,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-02-06 10:15:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:24,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-02-06 10:15:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16387, Invalid=20669, Unknown=0, NotChecked=0, Total=37056 [2025-02-06 10:15:24,028 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:15:32,055 INFO L93 Difference]: Finished difference Result 779 states and 842 transitions. [2025-02-06 10:15:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-02-06 10:15:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 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 292 [2025-02-06 10:15:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:15:32,059 INFO L225 Difference]: With dead ends: 779 [2025-02-06 10:15:32,059 INFO L226 Difference]: Without dead ends: 779 [2025-02-06 10:15:32,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23937 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=24640, Invalid=40640, Unknown=0, NotChecked=0, Total=65280 [2025-02-06 10:15:32,064 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1659 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:15:32,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 118 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:15:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-02-06 10:15:32,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 593. [2025-02-06 10:15:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 588 states have (on average 1.010204081632653) internal successors, (594), 592 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2025-02-06 10:15:32,080 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 292 [2025-02-06 10:15:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:15:32,080 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2025-02-06 10:15:32,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:15:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2025-02-06 10:15:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-02-06 10:15:32,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:15:32,090 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:15:32,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:15:32,293 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,SelfDestructingSolverStorable13 [2025-02-06 10:15:32,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:15:32,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:15:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash -469572667, now seen corresponding path program 2 times [2025-02-06 10:15:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:15:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031234915] [2025-02-06 10:15:32,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:15:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:15:32,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-02-06 10:15:32,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-02-06 10:15:32,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:15:32,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 23751 trivial. 0 not checked. [2025-02-06 10:15:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:15:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031234915] [2025-02-06 10:15:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031234915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:15:37,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152081669] [2025-02-06 10:15:37,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:15:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:15:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:15:37,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:15:37,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:15:37,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 580 statements into 2 equivalence classes. [2025-02-06 10:15:38,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 580 of 580 statements. [2025-02-06 10:15:38,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:15:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:15:38,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 2165 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-02-06 10:15:38,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:15:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-02-06 10:15:44,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:15:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29673 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 5922 trivial. 0 not checked. [2025-02-06 10:15:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152081669] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:15:59,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:15:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 130, 130] total 322 [2025-02-06 10:15:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868306928] [2025-02-06 10:15:59,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:15:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 322 states [2025-02-06 10:15:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:15:59,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 322 interpolants. [2025-02-06 10:15:59,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37122, Invalid=66240, Unknown=0, NotChecked=0, Total=103362 [2025-02-06 10:15:59,470 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand has 322 states, 322 states have (on average 3.0217391304347827) internal successors, (973), 322 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)