./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --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/verifythis/elimination_max_rec.c -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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:12:29,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:12:29,231 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:12:29,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:12:29,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:12:29,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:12:29,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:12:29,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:12:29,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:12:29,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:12:29,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:12:29,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:12:29,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:12:29,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:12:29,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:12:29,252 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:12:29,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:12:29,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:12:29,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:12:29,253 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2025-02-06 10:12:29,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:12:29,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:12:29,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:12:29,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:12:29,502 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:12:29,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2025-02-06 10:12:30,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084b58892/7115b067c1354215bcd6a8221ef7f319/FLAG5abcfc0cf [2025-02-06 10:12:30,936 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:12:30,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2025-02-06 10:12:30,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084b58892/7115b067c1354215bcd6a8221ef7f319/FLAG5abcfc0cf [2025-02-06 10:12:31,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/084b58892/7115b067c1354215bcd6a8221ef7f319 [2025-02-06 10:12:31,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:12:31,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:12:31,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:12:31,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:12:31,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:12:31,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31, skipping insertion in model container [2025-02-06 10:12:31,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:12:31,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:12:31,385 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:12:31,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:12:31,414 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:12:31,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31 WrapperNode [2025-02-06 10:12:31,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:12:31,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:12:31,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:12:31,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:12:31,421 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:12:31" (1/1) ... [2025-02-06 10:12:31,431 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:12:31" (1/1) ... [2025-02-06 10:12:31,445 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 34 [2025-02-06 10:12:31,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:12:31,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:12:31,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:12:31,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:12:31,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,467 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-06 10:12:31,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:12:31,485 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:12:31,485 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:12:31,485 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:12:31,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (1/1) ... [2025-02-06 10:12:31,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:12:31,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:31,513 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:12:31,516 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:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 10:12:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-02-06 10:12:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:12:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:12:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:12:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:12:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:12:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 10:12:31,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 10:12:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:12:31,594 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:12:31,596 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:12:31,798 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-02-06 10:12:31,798 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:12:31,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:12:31,810 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:12:31,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:12:31 BoogieIcfgContainer [2025-02-06 10:12:31,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:12:31,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:12:31,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:12:31,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:12:31,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:12:31" (1/3) ... [2025-02-06 10:12:31,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e17560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:12:31, skipping insertion in model container [2025-02-06 10:12:31,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:12:31" (2/3) ... [2025-02-06 10:12:31,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e17560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:12:31, skipping insertion in model container [2025-02-06 10:12:31,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:12:31" (3/3) ... [2025-02-06 10:12:31,821 INFO L128 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2025-02-06 10:12:31,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:12:31,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elimination_max_rec.c that has 4 procedures, 54 locations, 1 initial locations, 0 loop locations, and 13 error locations. [2025-02-06 10:12:31,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:12:31,882 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;@682ebbab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:12:31,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-06 10:12:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:12:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:12:31,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:31,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:31,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 101639501, now seen corresponding path program 1 times [2025-02-06 10:12:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868097681] [2025-02-06 10:12:31,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:31,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:12:31,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:12:31,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:31,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,013 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:12:32,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868097681] [2025-02-06 10:12:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868097681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:12:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718346997] [2025-02-06 10:12:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:12:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:12:32,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:12:32,040 INFO L87 Difference]: Start difference. First operand has 54 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:12:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:32,053 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-02-06 10:12:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:12:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 10:12:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:32,059 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:12:32,060 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:12:32,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:12:32,064 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:32,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:12:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:12:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:12:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 41 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:12:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-02-06 10:12:32,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2025-02-06 10:12:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-02-06 10:12:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:12:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-02-06 10:12:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:12:32,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:32,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:12:32,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash 230722220, now seen corresponding path program 1 times [2025-02-06 10:12:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761506204] [2025-02-06 10:12:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:32,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:12:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:12:32,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:32,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,343 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:12:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761506204] [2025-02-06 10:12:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761506204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:12:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422911181] [2025-02-06 10:12:32,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:12:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:12:32,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:12:32,345 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:12:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:32,472 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2025-02-06 10:12:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:12:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-06 10:12:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:32,475 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:12:32,475 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 10:12:32,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:12:32,476 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:32,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 258 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:12:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 10:12:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2025-02-06 10:12:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 58 states have internal predecessors, (69), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:12:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-02-06 10:12:32,486 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 16 [2025-02-06 10:12:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-02-06 10:12:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:12:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-02-06 10:12:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:12:32,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:32,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:32,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:12:32,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 229264000, now seen corresponding path program 1 times [2025-02-06 10:12:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250291620] [2025-02-06 10:12:32,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:32,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:12:32,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:12:32,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:32,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,550 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:12:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250291620] [2025-02-06 10:12:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:12:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024304565] [2025-02-06 10:12:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:12:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:12:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,553 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:32,568 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2025-02-06 10:12:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:12:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2025-02-06 10:12:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:32,570 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:12:32,571 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:12:32,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,572 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:32,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:12:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:12:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 10:12:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.511111111111111) internal successors, (68), 57 states have internal predecessors, (68), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:12:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2025-02-06 10:12:32,585 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 16 [2025-02-06 10:12:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:32,585 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2025-02-06 10:12:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2025-02-06 10:12:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:12:32,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:32,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:32,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:12:32,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1482750617, now seen corresponding path program 1 times [2025-02-06 10:12:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:32,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619596523] [2025-02-06 10:12:32,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:32,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:12:32,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:12:32,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:32,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,641 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:12:32,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619596523] [2025-02-06 10:12:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619596523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:12:32,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688888859] [2025-02-06 10:12:32,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:12:32,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:12:32,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,660 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:32,683 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2025-02-06 10:12:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:12:32,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-02-06 10:12:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:32,684 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:12:32,684 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:12:32,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,685 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:32,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:12:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:12:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 10:12:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.488888888888889) internal successors, (67), 56 states have internal predecessors, (67), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:12:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-02-06 10:12:32,692 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 17 [2025-02-06 10:12:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:32,692 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-02-06 10:12:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-02-06 10:12:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:12:32,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:32,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:12:32,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1279371102, now seen corresponding path program 1 times [2025-02-06 10:12:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704227057] [2025-02-06 10:12:32,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:32,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:32,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:12:32,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:12:32,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:32,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,766 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:12:32,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704227057] [2025-02-06 10:12:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704227057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:12:32,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613726200] [2025-02-06 10:12:32,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:12:32,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:12:32,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,768 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:32,808 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-02-06 10:12:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:12:32,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-06 10:12:32,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:32,811 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:12:32,811 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:12:32,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:12:32,812 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:32,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:12:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:12:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 10:12:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:12:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-02-06 10:12:32,819 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 18 [2025-02-06 10:12:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:32,820 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-02-06 10:12:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-02-06 10:12:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:12:32,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:32,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:32,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:12:32,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1499089873, now seen corresponding path program 1 times [2025-02-06 10:12:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:32,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-02-06 10:12:32,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:32,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:12:32,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:12:32,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:32,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:32,913 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:12:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120495139] [2025-02-06 10:12:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120495139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:32,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:12:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579343589] [2025-02-06 10:12:32,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:32,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:12:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:32,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:12:32,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:12:32,915 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:33,003 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-02-06 10:12:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:12:33,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-06 10:12:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:33,003 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:12:33,003 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:12:33,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:12:33,004 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:33,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:12:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:12:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-06 10:12:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.288888888888889) internal successors, (58), 51 states have internal predecessors, (58), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 10:12:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-02-06 10:12:33,011 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 19 [2025-02-06 10:12:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-02-06 10:12:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-02-06 10:12:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:12:33,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:33,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:12:33,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:33,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1499089874, now seen corresponding path program 1 times [2025-02-06 10:12:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:33,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-02-06 10:12:33,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:12:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:12:33,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:33,391 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:12:33,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445658616] [2025-02-06 10:12:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445658616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:12:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054448316] [2025-02-06 10:12:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:12:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:33,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:12:33,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:12:33,393 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:33,606 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2025-02-06 10:12:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:12:33,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-06 10:12:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:33,607 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:12:33,607 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:12:33,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:12:33,608 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:33,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 198 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:12:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:12:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2025-02-06 10:12:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 65 states have internal predecessors, (76), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 10:12:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2025-02-06 10:12:33,613 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 19 [2025-02-06 10:12:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:33,614 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2025-02-06 10:12:33,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2025-02-06 10:12:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:12:33,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:33,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:33,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:12:33,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1005798468, now seen corresponding path program 1 times [2025-02-06 10:12:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-02-06 10:12:33,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:33,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:12:33,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:12:33,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:33,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:33,674 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:12:33,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-02-06 10:12:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666249188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:33,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:33,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:12:33,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835109294] [2025-02-06 10:12:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:33,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:12:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:33,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:12:33,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:12:33,675 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:33,709 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-02-06 10:12:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:12:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-06 10:12:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:33,712 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:12:33,712 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:12:33,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:12:33,712 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:33,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:12:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:12:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 10:12:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 58 states have internal predecessors, (68), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 10:12:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-02-06 10:12:33,720 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 19 [2025-02-06 10:12:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-02-06 10:12:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-02-06 10:12:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:12:33,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:33,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:12:33,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -772854186, now seen corresponding path program 1 times [2025-02-06 10:12:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-02-06 10:12:33,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:33,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:12:33,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:12:33,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:33,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:33,996 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:12:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193894811] [2025-02-06 10:12:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193894811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:33,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:12:33,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:12:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642074325] [2025-02-06 10:12:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:33,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:12:33,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:33,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:12:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:12:33,998 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:34,175 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-02-06 10:12:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:12:34,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-06 10:12:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:34,178 INFO L225 Difference]: With dead ends: 89 [2025-02-06 10:12:34,178 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 10:12:34,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:12:34,179 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:34,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 175 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:12:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 10:12:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2025-02-06 10:12:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 58 states have internal predecessors, (65), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 10:12:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2025-02-06 10:12:34,186 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 20 [2025-02-06 10:12:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:34,186 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-02-06 10:12:34,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2025-02-06 10:12:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:12:34,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:34,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:34,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:12:34,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2030203741, now seen corresponding path program 1 times [2025-02-06 10:12:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:34,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018847735] [2025-02-06 10:12:34,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:34,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:12:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:12:34,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:34,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018847735] [2025-02-06 10:12:34,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018847735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:34,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728828268] [2025-02-06 10:12:34,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:34,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:34,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:34,349 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:12:34,351 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:12:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:12:34,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:12:34,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:34,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:34,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:12:34,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:34,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:12:34,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728828268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:12:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-02-06 10:12:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554565461] [2025-02-06 10:12:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:12:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:34,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:12:34,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:12:34,518 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:34,653 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2025-02-06 10:12:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:12:34,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-06 10:12:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:34,654 INFO L225 Difference]: With dead ends: 106 [2025-02-06 10:12:34,654 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 10:12:34,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:12:34,655 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:34,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:12:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 10:12:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2025-02-06 10:12:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 61 states have internal predecessors, (68), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 10:12:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2025-02-06 10:12:34,662 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 28 [2025-02-06 10:12:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:34,662 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2025-02-06 10:12:34,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:12:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2025-02-06 10:12:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:12:34,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:34,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:34,679 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:12:34,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 10:12:34,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:34,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -69078405, now seen corresponding path program 1 times [2025-02-06 10:12:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972763345] [2025-02-06 10:12:34,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:12:34,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:12:34,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:34,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972763345] [2025-02-06 10:12:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972763345] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625148552] [2025-02-06 10:12:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:35,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:35,097 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:12:35,099 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:12:35,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:12:35,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:12:35,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:35,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:35,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:12:35,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:35,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:12:35,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625148552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:12:35,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:12:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 18 [2025-02-06 10:12:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364457345] [2025-02-06 10:12:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:12:35,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:12:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:35,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:12:35,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:12:35,434 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:12:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:35,847 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2025-02-06 10:12:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:12:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-02-06 10:12:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:35,848 INFO L225 Difference]: With dead ends: 141 [2025-02-06 10:12:35,848 INFO L226 Difference]: Without dead ends: 141 [2025-02-06 10:12:35,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:12:35,849 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 124 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:35,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 226 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:12:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-06 10:12:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 109. [2025-02-06 10:12:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 81 states have internal predecessors, (94), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-06 10:12:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2025-02-06 10:12:35,857 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 31 [2025-02-06 10:12:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:35,857 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2025-02-06 10:12:35,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:12:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2025-02-06 10:12:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:12:35,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:35,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:35,868 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:12:36,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:36,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2141430579, now seen corresponding path program 1 times [2025-02-06 10:12:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-02-06 10:12:36,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:36,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:12:36,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:12:36,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:36,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:36,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:36,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180060895] [2025-02-06 10:12:36,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180060895] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:36,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011350651] [2025-02-06 10:12:36,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:36,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:36,283 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:12:36,284 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:12:36,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:12:36,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:12:36,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:36,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:36,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:12:36,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:36,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 10:12:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011350651] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:12:36,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:12:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-02-06 10:12:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86321855] [2025-02-06 10:12:36,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:12:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:36,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:12:36,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:12:36,820 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 28 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 10:12:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:37,944 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2025-02-06 10:12:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:12:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 32 [2025-02-06 10:12:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:37,945 INFO L225 Difference]: With dead ends: 144 [2025-02-06 10:12:37,946 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 10:12:37,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=413, Invalid=1843, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 10:12:37,947 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 208 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:37,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 803 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:12:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 10:12:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2025-02-06 10:12:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 75 states have (on average 1.24) internal successors, (93), 80 states have internal predecessors, (93), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-06 10:12:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2025-02-06 10:12:37,956 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 32 [2025-02-06 10:12:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:37,956 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2025-02-06 10:12:37,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 10:12:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2025-02-06 10:12:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:12:37,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:37,958 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:37,964 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:12:38,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:38,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:38,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2011776872, now seen corresponding path program 1 times [2025-02-06 10:12:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-02-06 10:12:38,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:38,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:12:38,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:12:38,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:38,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:12:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-02-06 10:12:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487449905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946596198] [2025-02-06 10:12:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:38,328 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:12:38,329 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:12:38,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:12:38,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:12:38,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:38,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:38,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 10:12:38,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:12:38,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:38,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-02-06 10:12:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:12:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946596198] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:12:38,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:12:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-02-06 10:12:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838812899] [2025-02-06 10:12:38,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:38,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:12:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:12:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:12:38,771 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 10 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 10:12:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:39,212 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2025-02-06 10:12:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:12:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 10 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 33 [2025-02-06 10:12:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:39,213 INFO L225 Difference]: With dead ends: 134 [2025-02-06 10:12:39,213 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 10:12:39,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1150, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 10:12:39,214 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 102 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:39,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 415 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:12:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 10:12:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2025-02-06 10:12:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 79 states have internal predecessors, (88), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-06 10:12:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2025-02-06 10:12:39,219 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 33 [2025-02-06 10:12:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:39,219 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2025-02-06 10:12:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 10 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-06 10:12:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2025-02-06 10:12:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:12:39,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:39,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:39,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:12:39,420 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,SelfDestructingSolverStorable12 [2025-02-06 10:12:39,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash -582291851, now seen corresponding path program 1 times [2025-02-06 10:12:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-02-06 10:12:39,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:39,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:12:39,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:12:39,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:39,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850443205] [2025-02-06 10:12:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850443205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160225033] [2025-02-06 10:12:39,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:39,618 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:12:39,620 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:12:39,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:12:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:12:39,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:39,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:12:39,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:39,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:40,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-02-06 10:12:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160225033] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:12:40,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:12:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2025-02-06 10:12:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625427004] [2025-02-06 10:12:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:12:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:40,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:12:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:12:40,251 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 36 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 30 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:12:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:41,438 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2025-02-06 10:12:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 10:12:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 30 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 35 [2025-02-06 10:12:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:41,440 INFO L225 Difference]: With dead ends: 183 [2025-02-06 10:12:41,441 INFO L226 Difference]: Without dead ends: 183 [2025-02-06 10:12:41,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=588, Invalid=3572, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 10:12:41,443 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 369 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:41,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 506 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:12:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-06 10:12:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 130. [2025-02-06 10:12:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.141304347826087) internal successors, (105), 95 states have internal predecessors, (105), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (27), 23 states have call predecessors, (27), 20 states have call successors, (27) [2025-02-06 10:12:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2025-02-06 10:12:41,452 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 35 [2025-02-06 10:12:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:41,452 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2025-02-06 10:12:41,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 30 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 10:12:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2025-02-06 10:12:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:12:41,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:41,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:41,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:12:41,654 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,SelfDestructingSolverStorable13 [2025-02-06 10:12:41,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash -940122819, now seen corresponding path program 1 times [2025-02-06 10:12:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006579116] [2025-02-06 10:12:41,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:41,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:12:41,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:12:41,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:41,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:12:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006579116] [2025-02-06 10:12:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006579116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507725474] [2025-02-06 10:12:41,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:41,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:41,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:41,818 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:12:41,820 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:12:41,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:12:41,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:12:41,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:41,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:12:41,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:41,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2025-02-06 10:12:42,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-02-06 10:12:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:12:42,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507725474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:46,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:12:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 24 [2025-02-06 10:12:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341333885] [2025-02-06 10:12:46,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:12:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:12:46,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:12:46,323 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 24 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 10:12:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:46,646 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2025-02-06 10:12:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:12:46,646 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2025-02-06 10:12:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:46,647 INFO L225 Difference]: With dead ends: 132 [2025-02-06 10:12:46,647 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 10:12:46,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:12:46,648 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:46,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 252 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:12:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 10:12:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 65. [2025-02-06 10:12:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 states have internal predecessors, (51), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 10:12:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-02-06 10:12:46,651 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 40 [2025-02-06 10:12:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:46,652 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-02-06 10:12:46,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 7 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 10:12:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-02-06 10:12:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:12:46,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:46,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:46,663 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:12:46,855 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,SelfDestructingSolverStorable14 [2025-02-06 10:12:46,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:46,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1839454362, now seen corresponding path program 1 times [2025-02-06 10:12:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:46,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-02-06 10:12:46,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:46,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:12:46,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:12:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-06 10:12:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302456934] [2025-02-06 10:12:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302456934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432615407] [2025-02-06 10:12:47,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:47,367 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:12:47,368 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:12:47,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:12:47,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:12:47,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:47,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:12:47,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 10:12:47,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432615407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:48,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:12:48,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2025-02-06 10:12:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554730533] [2025-02-06 10:12:48,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:48,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:12:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:48,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:12:48,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:12:48,212 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 16 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-06 10:12:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:51,571 INFO L93 Difference]: Finished difference Result 392 states and 512 transitions. [2025-02-06 10:12:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-06 10:12:51,572 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 16 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Word has length 89 [2025-02-06 10:12:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:51,575 INFO L225 Difference]: With dead ends: 392 [2025-02-06 10:12:51,575 INFO L226 Difference]: Without dead ends: 392 [2025-02-06 10:12:51,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4486 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1532, Invalid=14724, Unknown=0, NotChecked=0, Total=16256 [2025-02-06 10:12:51,579 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 511 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2065 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:12:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-06 10:12:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 189. [2025-02-06 10:12:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 133 states have (on average 1.112781954887218) internal successors, (148), 135 states have internal predecessors, (148), 37 states have call successors, (37), 11 states have call predecessors, (37), 18 states have return successors, (56), 42 states have call predecessors, (56), 36 states have call successors, (56) [2025-02-06 10:12:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 241 transitions. [2025-02-06 10:12:51,601 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 241 transitions. Word has length 89 [2025-02-06 10:12:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 241 transitions. [2025-02-06 10:12:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 2.586206896551724) internal successors, (75), 26 states have internal predecessors, (75), 16 states have call successors, (21), 8 states have call predecessors, (21), 4 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-06 10:12:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 241 transitions. [2025-02-06 10:12:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 10:12:51,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:51,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:51,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:12:51,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:51,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1385231080, now seen corresponding path program 1 times [2025-02-06 10:12:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403857870] [2025-02-06 10:12:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:51,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:12:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:12:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-06 10:12:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:51,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403857870] [2025-02-06 10:12:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403857870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844143637] [2025-02-06 10:12:51,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:12:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:51,959 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:12:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:12:52,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 10:12:52,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 10:12:52,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:12:52,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:52,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:12:52,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 10:12:52,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844143637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:52,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:12:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 28 [2025-02-06 10:12:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974949184] [2025-02-06 10:12:52,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:52,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:12:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:52,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:12:52,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:12:52,734 INFO L87 Difference]: Start difference. First operand 189 states and 241 transitions. Second operand has 28 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-02-06 10:12:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:53,830 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-02-06 10:12:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:12:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 89 [2025-02-06 10:12:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:53,831 INFO L225 Difference]: With dead ends: 135 [2025-02-06 10:12:53,831 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:12:53,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=510, Invalid=3396, Unknown=0, NotChecked=0, Total=3906 [2025-02-06 10:12:53,833 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:53,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 569 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:12:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:12:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2025-02-06 10:12:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 states have internal predecessors, (94), 21 states have call successors, (21), 12 states have call predecessors, (21), 15 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2025-02-06 10:12:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2025-02-06 10:12:53,840 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 89 [2025-02-06 10:12:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2025-02-06 10:12:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 13 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-02-06 10:12:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2025-02-06 10:12:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 10:12:53,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:12:53,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:53,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:12:54,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 10:12:54,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 10 more)] === [2025-02-06 10:12:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:12:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2064871188, now seen corresponding path program 2 times [2025-02-06 10:12:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:12:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-06 10:12:54,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:12:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:12:54,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 10:12:54,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:12:54,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:12:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-06 10:12:54,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:12:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-06 10:12:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872605618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004065338] [2025-02-06 10:12:54,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:12:54,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:12:54,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:12:54,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:12:54,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:12:54,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-02-06 10:12:54,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 10:12:54,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:12:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:12:54,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:12:54,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:12:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:12:54,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:12:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004065338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:12:54,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:12:54,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2025-02-06 10:12:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340729308] [2025-02-06 10:12:54,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:12:54,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:12:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:12:54,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:12:54,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:12:54,856 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 27 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 22 states have internal predecessors, (51), 12 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 10:12:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:12:55,419 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2025-02-06 10:12:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:12:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 22 states have internal predecessors, (51), 12 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 65 [2025-02-06 10:12:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:12:55,421 INFO L225 Difference]: With dead ends: 131 [2025-02-06 10:12:55,421 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:12:55,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=316, Invalid=2234, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 10:12:55,422 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:12:55,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 448 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:12:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:12:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:12:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:12:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:12:55,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-02-06 10:12:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:12:55,422 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:12:55,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 22 states have internal predecessors, (51), 12 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 10:12:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:12:55,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:12:55,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2025-02-06 10:12:55,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (11 of 13 remaining) [2025-02-06 10:12:55,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (10 of 13 remaining) [2025-02-06 10:12:55,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (9 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-02-06 10:12:55,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-02-06 10:12:55,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-02-06 10:12:55,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:12:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 10:12:55,631 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:12:55,632 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:12:55,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:12:55 BoogieIcfgContainer [2025-02-06 10:12:55,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:12:55,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:12:55,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:12:55,635 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:12:55,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:12:31" (3/4) ... [2025-02-06 10:12:55,637 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:12:55,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 10:12:55,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2025-02-06 10:12:55,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 10:12:55,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-06 10:12:55,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-06 10:12:55,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 10:12:55,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:12:55,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:12:55,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:12:55,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:12:55,702 INFO L158 Benchmark]: Toolchain (without parser) took 24456.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.0MB in the beginning and 192.6MB in the end (delta: -70.6MB). Peak memory consumption was 45.9kB. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.21ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.15ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: IcfgBuilder took 326.63ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.4MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: TraceAbstraction took 23820.51ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 92.8MB in the beginning and 197.5MB in the end (delta: -104.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:12:55,702 INFO L158 Benchmark]: Witness Printer took 66.05ms. Allocated memory is still 243.3MB. Free memory was 197.5MB in the beginning and 192.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:12:55,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.21ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.15ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 326.63ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 93.4MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23820.51ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 92.8MB in the beginning and 197.5MB in the end (delta: -104.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 66.05ms. Allocated memory is still 243.3MB. Free memory was 197.5MB in the beginning and 192.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 5]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1812 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1798 mSDsluCounter, 6840 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5980 mSDsCounter, 816 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7723 IncrementalHoareTripleChecker+Invalid, 8539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 816 mSolverCounterUnsat, 860 mSDtfsCounter, 7723 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 468 SyntacticMatches, 13 SemanticMatches, 499 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7104 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=16, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 485 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 1044 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1114 ConstructedInterpolants, 52 QuantifiedInterpolants, 6169 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1964 ConjunctsInSsa, 273 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 414/656 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:12:55,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE