./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 11:51:53,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:51:53,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:51:53,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:51:53,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:51:53,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:51:53,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:51:53,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:51:53,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:51:53,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:51:53,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:51:53,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:51:53,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:51:53,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:51:53,511 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:51:53,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:51:53,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:51:53,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:51:53,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:51:53,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:51:53,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:51:53,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:51:53,514 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/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-03-17 11:51:53,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:51:53,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:51:53,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:51:53,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:51:53,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:51:53,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2025-03-17 11:51:54,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fa8db5/eefb423bc4cf45388295a4cad8a15820/FLAGdf52978d6 [2025-03-17 11:51:55,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:51:55,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec.c [2025-03-17 11:51:55,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fa8db5/eefb423bc4cf45388295a4cad8a15820/FLAGdf52978d6 [2025-03-17 11:51:55,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c57fa8db5/eefb423bc4cf45388295a4cad8a15820 [2025-03-17 11:51:55,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:51:55,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:51:55,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:51:55,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:51:55,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:51:55,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55, skipping insertion in model container [2025-03-17 11:51:55,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:51:55,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:51:55,227 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:51:55,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:51:55,253 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:51:55,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55 WrapperNode [2025-03-17 11:51:55,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:51:55,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:51:55,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:51:55,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:51:55,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,284 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 34 [2025-03-17 11:51:55,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:51:55,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:51:55,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:51:55,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:51:55,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,309 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-03-17 11:51:55,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:51:55,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:51:55,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:51:55,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:51:55,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (1/1) ... [2025-03-17 11:51:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:51:55,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:55,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:51:55,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 11:51:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-03-17 11:51:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-03-17 11:51:55,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:51:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:51:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:51:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:51:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:51:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:51:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:51:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:51:55,443 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:51:55,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:51:55,656 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-17 11:51:55,656 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:51:55,664 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:51:55,664 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:51:55,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:51:55 BoogieIcfgContainer [2025-03-17 11:51:55,665 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:51:55,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:51:55,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:51:55,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:51:55,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:51:55" (1/3) ... [2025-03-17 11:51:55,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f40d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:51:55, skipping insertion in model container [2025-03-17 11:51:55,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:55" (2/3) ... [2025-03-17 11:51:55,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f40d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:51:55, skipping insertion in model container [2025-03-17 11:51:55,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:51:55" (3/3) ... [2025-03-17 11:51:55,673 INFO L128 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2025-03-17 11:51:55,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:51:55,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elimination_max_rec.c that has 4 procedures, 51 locations, 1 initial locations, 0 loop locations, and 13 error locations. [2025-03-17 11:51:55,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:51:55,724 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;@5502e79a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:51:55,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 11:51:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 41 states have internal predecessors, (45), 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-03-17 11:51:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:51:55,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:55,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:55,733 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-03-17 11:51:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1422099752, now seen corresponding path program 1 times [2025-03-17 11:51:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:55,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268332909] [2025-03-17 11:51:55,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:55,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:51:55,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:51:55,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268332909] [2025-03-17 11:51:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268332909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:51:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595988369] [2025-03-17 11:51:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:55,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:51:55,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:55,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:51:55,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:51:55,866 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 41 states have internal predecessors, (45), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03-17 11:51:55,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:55,878 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-03-17 11:51:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:51:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2025-03-17 11:51:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:55,885 INFO L225 Difference]: With dead ends: 51 [2025-03-17 11:51:55,886 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:51:55,889 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-03-17 11:51:55,891 INFO L435 NwaCegarLoop]: 55 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, 55 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-03-17 11:51:55,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:51:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 11:51:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 39 states have internal predecessors, (41), 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-03-17 11:51:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-17 11:51:55,925 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2025-03-17 11:51:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:55,925 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-17 11:51:55,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-03-17 11:51:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-17 11:51:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:51:55,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:55,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:51:55,927 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-03-17 11:51:55,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -374851607, now seen corresponding path program 1 times [2025-03-17 11:51:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-03-17 11:51:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:55,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:51:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:51:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:56,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560034184] [2025-03-17 11:51:56,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560034184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:56,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:51:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642725851] [2025-03-17 11:51:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:51:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:51:56,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:51:56,229 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 11:51:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:56,358 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2025-03-17 11:51:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:51:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2025-03-17 11:51:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:56,361 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:51:56,361 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:51:56,361 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-03-17 11:51:56,362 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:56,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:51:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2025-03-17 11:51:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.558139534883721) 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-03-17 11:51:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-03-17 11:51:56,372 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 14 [2025-03-17 11:51:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:56,373 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-03-17 11:51:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-03-17 11:51:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-03-17 11:51:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:51:56,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:56,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:56,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:51:56,373 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-03-17 11:51:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash -376279940, now seen corresponding path program 1 times [2025-03-17 11:51:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799827176] [2025-03-17 11:51:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:56,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:51:56,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:51:56,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:56,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799827176] [2025-03-17 11:51:56,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799827176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:56,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:56,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:51:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945397743] [2025-03-17 11:51:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:51:56,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:51:56,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,419 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-03-17 11:51:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:56,435 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-03-17 11:51:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:51:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2025-03-17 11:51:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:56,436 INFO L225 Difference]: With dead ends: 71 [2025-03-17 11:51:56,436 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 11:51:56,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,436 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:56,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 11:51:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 11:51:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.5348837209302326) 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-03-17 11:51:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-03-17 11:51:56,442 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 14 [2025-03-17 11:51:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:56,442 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-03-17 11:51:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-03-17 11:51:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-03-17 11:51:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:51:56,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:56,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:56,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:51:56,443 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-03-17 11:51:56,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1220223722, now seen corresponding path program 1 times [2025-03-17 11:51:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-17 11:51:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:56,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:51:56,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:51:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-03-17 11:51:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235198179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:51:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91093354] [2025-03-17 11:51:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:51:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:51:56,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,486 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-03-17 11:51:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:56,497 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-03-17 11:51:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:51:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2025-03-17 11:51:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:56,498 INFO L225 Difference]: With dead ends: 70 [2025-03-17 11:51:56,498 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 11:51:56,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,499 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 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-03-17 11:51:56,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 11:51:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 11:51:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 54 states have internal predecessors, (65), 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-03-17 11:51:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2025-03-17 11:51:56,505 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 15 [2025-03-17 11:51:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:56,505 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2025-03-17 11:51:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-03-17 11:51:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2025-03-17 11:51:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:51:56,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:56,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:56,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:51:56,506 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-03-17 11:51:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -827770310, now seen corresponding path program 1 times [2025-03-17 11:51:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:56,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085066924] [2025-03-17 11:51:56,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:51:56,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:51:56,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:56,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085066924] [2025-03-17 11:51:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085066924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:51:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523609468] [2025-03-17 11:51:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:51:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:51:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,557 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-03-17 11:51:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:56,575 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-17 11:51:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:51:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-03-17 11:51:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:56,576 INFO L225 Difference]: With dead ends: 69 [2025-03-17 11:51:56,576 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 11:51:56,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:51:56,576 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:56,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 11:51:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 11:51:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 53 states have internal predecessors, (64), 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-03-17 11:51:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2025-03-17 11:51:56,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 16 [2025-03-17 11:51:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2025-03-17 11:51:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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-03-17 11:51:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2025-03-17 11:51:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:51:56,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:56,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:51:56,586 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-03-17 11:51:56,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash -288151024, now seen corresponding path program 1 times [2025-03-17 11:51:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822550223] [2025-03-17 11:51:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:56,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:51:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:51:56,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:56,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:56,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822550223] [2025-03-17 11:51:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822550223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:51:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751651785] [2025-03-17 11:51:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:51:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:51:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:51:56,662 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-17 11:51:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:56,725 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2025-03-17 11:51:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:51:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2025-03-17 11:51:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:56,726 INFO L225 Difference]: With dead ends: 69 [2025-03-17 11:51:56,726 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 11:51:56,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:51:56,726 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:56,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 80 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 11:51:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2025-03-17 11:51:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.302325581395349) internal successors, (56), 49 states have internal predecessors, (56), 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-03-17 11:51:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-17 11:51:56,731 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 17 [2025-03-17 11:51:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:56,731 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-17 11:51:56,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-17 11:51:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-17 11:51:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:51:56,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:56,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:56,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:51:56,731 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-03-17 11:51:56,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash -288151023, now seen corresponding path program 1 times [2025-03-17 11:51:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:56,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132970718] [2025-03-17 11:51:56,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:56,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:51:56,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:51:56,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:56,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132970718] [2025-03-17 11:51:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132970718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:51:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514919853] [2025-03-17 11:51:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:51:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:57,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:51:57,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:51:57,052 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-03-17 11:51:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:57,247 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2025-03-17 11:51:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:51:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 17 [2025-03-17 11:51:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:57,248 INFO L225 Difference]: With dead ends: 92 [2025-03-17 11:51:57,248 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 11:51:57,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:51:57,248 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:57,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 145 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 11:51:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2025-03-17 11:51:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 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-03-17 11:51:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2025-03-17 11:51:57,253 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 17 [2025-03-17 11:51:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:57,253 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2025-03-17 11:51:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-03-17 11:51:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2025-03-17 11:51:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:51:57,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:57,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:57,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:51:57,254 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-03-17 11:51:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 108924136, now seen corresponding path program 1 times [2025-03-17 11:51:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 11:51:57,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:57,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:51:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:51:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231123716] [2025-03-17 11:51:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231123716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:57,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:57,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:51:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115564331] [2025-03-17 11:51:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:51:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:57,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:51:57,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:57,309 INFO L87 Difference]: Start difference. First operand 84 states and 106 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-03-17 11:51:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:57,331 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-03-17 11:51:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:51:57,332 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-03-17 11:51:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:57,332 INFO L225 Difference]: With dead ends: 83 [2025-03-17 11:51:57,333 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 11:51:57,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:57,334 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:57,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 11:51:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 11:51:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.346938775510204) internal successors, (66), 56 states have internal predecessors, (66), 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-03-17 11:51:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2025-03-17 11:51:57,342 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 17 [2025-03-17 11:51:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:57,343 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2025-03-17 11:51:57,343 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-03-17 11:51:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2025-03-17 11:51:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 11:51:57,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:57,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:57,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:51:57,343 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-03-17 11:51:57,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash -342747148, now seen corresponding path program 1 times [2025-03-17 11:51:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885790483] [2025-03-17 11:51:57,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:57,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 11:51:57,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 11:51:57,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:57,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:57,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885790483] [2025-03-17 11:51:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885790483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:51:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933070896] [2025-03-17 11:51:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:57,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:51:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:57,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:51:57,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:51:57,588 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-03-17 11:51:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:57,774 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2025-03-17 11:51:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:51:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 18 [2025-03-17 11:51:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:57,776 INFO L225 Difference]: With dead ends: 87 [2025-03-17 11:51:57,776 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 11:51:57,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:51:57,777 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:57,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 158 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 11:51:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2025-03-17 11:51:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 56 states have internal predecessors, (63), 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-03-17 11:51:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2025-03-17 11:51:57,785 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 18 [2025-03-17 11:51:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:57,785 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2025-03-17 11:51:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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-03-17 11:51:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2025-03-17 11:51:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:51:57,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:57,786 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] [2025-03-17 11:51:57,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:51:57,786 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-03-17 11:51:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1721969856, now seen corresponding path program 1 times [2025-03-17 11:51:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-03-17 11:51:57,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:57,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:57,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:57,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:57,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-03-17 11:51:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760322394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980135884] [2025-03-17 11:51:57,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:57,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:57,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:51:58,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:51:58,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:58,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:51:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980135884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:58,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:51:58,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-17 11:51:58,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830912713] [2025-03-17 11:51:58,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:58,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:51:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:58,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:51:58,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:51:58,156 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 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-03-17 11:51:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:58,309 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2025-03-17 11:51:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:51:58,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 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 26 [2025-03-17 11:51:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:58,312 INFO L225 Difference]: With dead ends: 104 [2025-03-17 11:51:58,312 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 11:51:58,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-03-17 11:51:58,313 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 62 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:58,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 248 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 11:51:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2025-03-17 11:51:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 59 states have internal predecessors, (66), 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-03-17 11:51:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2025-03-17 11:51:58,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 26 [2025-03-17 11:51:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2025-03-17 11:51:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 5 states have internal predecessors, (19), 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-03-17 11:51:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2025-03-17 11:51:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:51:58,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:58,323 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] [2025-03-17 11:51:58,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:51:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 11:51:58,525 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-03-17 11:51:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash -113493158, now seen corresponding path program 1 times [2025-03-17 11:51:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-03-17 11:51:58,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:51:58,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:51:58,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:51:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104895249] [2025-03-17 11:51:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104895249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617428938] [2025-03-17 11:51:58,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:58,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:58,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:51:58,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:51:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:51:58,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:51:58,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:51:58,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:51:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617428938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:58,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:51:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-03-17 11:51:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611047314] [2025-03-17 11:51:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:51:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:58,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:51:58,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:51:58,999 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-03-17 11:51:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:59,346 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2025-03-17 11:51:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:51:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 29 [2025-03-17 11:51:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:59,347 INFO L225 Difference]: With dead ends: 139 [2025-03-17 11:51:59,347 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 11:51:59,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:51:59,348 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 107 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:59,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 192 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:51:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 11:51:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 107. [2025-03-17 11:51:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 79 states have internal predecessors, (92), 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-03-17 11:51:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2025-03-17 11:51:59,353 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 29 [2025-03-17 11:51:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2025-03-17 11:51:59,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-03-17 11:51:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2025-03-17 11:51:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:51:59,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:59,354 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] [2025-03-17 11:51:59,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:51:59,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 11:51:59,555 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-03-17 11:51:59,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash 776679371, now seen corresponding path program 1 times [2025-03-17 11:51:59,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:59,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797362476] [2025-03-17 11:51:59,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:59,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:59,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:51:59,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:51:59,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:59,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:51:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797362476] [2025-03-17 11:51:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797362476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954111123] [2025-03-17 11:51:59,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:59,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:59,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:59,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:59,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:51:59,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:51:59,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:51:59,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:59,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:59,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:51:59,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:00,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:00,237 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-03-17 11:52:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954111123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:00,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:00,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-17 11:52:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942802285] [2025-03-17 11:52:00,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:00,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:52:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:00,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:52:00,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:52:00,298 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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-03-17 11:52:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:01,144 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2025-03-17 11:52:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:52:01,145 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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 30 [2025-03-17 11:52:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:01,145 INFO L225 Difference]: With dead ends: 142 [2025-03-17 11:52:01,145 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 11:52:01,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 11:52:01,146 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 221 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:01,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 527 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:52:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 11:52:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 106. [2025-03-17 11:52:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 78 states have internal predecessors, (91), 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-03-17 11:52:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-03-17 11:52:01,154 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 30 [2025-03-17 11:52:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-03-17 11:52:01,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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-03-17 11:52:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-03-17 11:52:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:52:01,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:01,157 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] [2025-03-17 11:52:01,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:01,358 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-03-17 11:52:01,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1337855356, now seen corresponding path program 1 times [2025-03-17 11:52:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-17 11:52:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:52:01,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:52:01,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:01,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-17 11:52:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294941690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133004561] [2025-03-17 11:52:01,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:01,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:01,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:01,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:01,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:52:01,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:52:01,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:52:01,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:01,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:01,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 11:52:01,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:01,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:01,819 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-03-17 11:52:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:52:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133004561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:01,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2025-03-17 11:52:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150449236] [2025-03-17 11:52:01,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:01,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:52:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:01,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:52:01,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:52:01,905 INFO L87 Difference]: Start difference. First operand 106 states and 132 transitions. Second operand has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 11:52:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:02,327 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-17 11:52:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:52:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 31 [2025-03-17 11:52:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:02,328 INFO L225 Difference]: With dead ends: 82 [2025-03-17 11:52:02,328 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 11:52:02,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:52:02,329 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 119 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:02,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 274 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 11:52:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-17 11:52:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 53 states have internal predecessors, (59), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 11:52:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2025-03-17 11:52:02,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 31 [2025-03-17 11:52:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2025-03-17 11:52:02,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 16 states have internal predecessors, (41), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 11:52:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2025-03-17 11:52:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:52:02,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:02,334 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-03-17 11:52:02,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:02,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:02,539 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-03-17 11:52:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -23777352, now seen corresponding path program 1 times [2025-03-17 11:52:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240864650] [2025-03-17 11:52:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:02,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:52:02,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:52:02,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:02,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240864650] [2025-03-17 11:52:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240864650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260366633] [2025-03-17 11:52:02,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:02,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:52:02,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:52:02,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:52:02,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:02,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:02,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 11:52:02,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:03,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:03,190 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-03-17 11:52:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260366633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:03,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:03,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2025-03-17 11:52:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572450150] [2025-03-17 11:52:03,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:03,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:52:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:03,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:52:03,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 11:52:03,273 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 33 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 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-03-17 11:52:07,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:52:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:08,196 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-03-17 11:52:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:52:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 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 33 [2025-03-17 11:52:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:08,198 INFO L225 Difference]: With dead ends: 98 [2025-03-17 11:52:08,198 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 11:52:08,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=2445, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 11:52:08,199 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 202 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 108 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:08,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 384 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 607 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 11:52:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 11:52:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2025-03-17 11:52:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 12 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-17 11:52:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-03-17 11:52:08,202 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 33 [2025-03-17 11:52:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:08,202 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-03-17 11:52:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 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-03-17 11:52:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-03-17 11:52:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:52:08,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:08,203 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] [2025-03-17 11:52:08,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:08,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 11:52:08,404 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-03-17 11:52:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1108723287, now seen corresponding path program 1 times [2025-03-17 11:52:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380012279] [2025-03-17 11:52:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:08,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:52:08,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:52:08,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:08,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380012279] [2025-03-17 11:52:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380012279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954219515] [2025-03-17 11:52:08,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:08,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:08,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:08,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:08,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:52:08,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:52:08,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:52:08,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:08,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:08,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:52:08,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:08,609 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-03-17 11:52:08,840 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-03-17 11:52:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:52:08,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:13,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954219515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:13,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 23 [2025-03-17 11:52:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926574733] [2025-03-17 11:52:13,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:13,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:52:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:13,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:52:13,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:52:13,067 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 23 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 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-03-17 11:52:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:13,358 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-03-17 11:52:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:52:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 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 38 [2025-03-17 11:52:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:13,358 INFO L225 Difference]: With dead ends: 82 [2025-03-17 11:52:13,358 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 11:52:13,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:52:13,359 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:13,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 238 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:52:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 11:52:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 11:52:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 11:52:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2025-03-17 11:52:13,361 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2025-03-17 11:52:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:13,361 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2025-03-17 11:52:13,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.15) internal successors, (43), 19 states have internal predecessors, (43), 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-03-17 11:52:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2025-03-17 11:52:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 11:52:13,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:13,362 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:13,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:13,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 11:52:13,563 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-03-17 11:52:13,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:13,563 INFO L85 PathProgramCache]: Analyzing trace with hash -190443186, now seen corresponding path program 1 times [2025-03-17 11:52:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:13,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-03-17 11:52:13,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:13,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:13,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:52:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:52:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 11:52:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-03-17 11:52:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802137587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467405012] [2025-03-17 11:52:13,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:13,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:13,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:52:13,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:52:13,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:52:13,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:13,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:13,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 11:52:13,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 38 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 11:52:14,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467405012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:14,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18] total 25 [2025-03-17 11:52:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988296115] [2025-03-17 11:52:14,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:52:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:14,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:52:14,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:52:14,572 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 25 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 11:52:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:15,137 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-17 11:52:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:52:15,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) Word has length 87 [2025-03-17 11:52:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:15,138 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:52:15,138 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:52:15,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 11:52:15,138 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:15,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 307 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:52:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:52:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-03-17 11:52:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-17 11:52:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-03-17 11:52:15,140 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 87 [2025-03-17 11:52:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-03-17 11:52:15,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.727272727272727) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (18), 11 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-17 11:52:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-03-17 11:52:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 11:52:15,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:15,142 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] [2025-03-17 11:52:15,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:15,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:15,346 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-03-17 11:52:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1231451701, now seen corresponding path program 1 times [2025-03-17 11:52:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:15,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-17 11:52:15,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:15,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:52:15,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:52:15,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:15,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 11:52:15,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802203745] [2025-03-17 11:52:15,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802203745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817606132] [2025-03-17 11:52:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:15,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:15,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:15,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:15,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:52:15,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 11:52:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 11:52:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:15,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:52:15,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 11:52:16,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:16,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817606132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:16,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 32 [2025-03-17 11:52:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068221171] [2025-03-17 11:52:16,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:16,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:52:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:16,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:52:16,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 11:52:16,538 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 33 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 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-03-17 11:52:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:17,823 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2025-03-17 11:52:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 11:52:17,824 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 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 87 [2025-03-17 11:52:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:17,824 INFO L225 Difference]: With dead ends: 122 [2025-03-17 11:52:17,824 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 11:52:17,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=735, Invalid=5117, Unknown=0, NotChecked=0, Total=5852 [2025-03-17 11:52:17,826 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 155 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:17,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 779 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:52:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 11:52:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2025-03-17 11:52:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (23), 21 states have call predecessors, (23), 18 states have call successors, (23) [2025-03-17 11:52:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2025-03-17 11:52:17,829 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 87 [2025-03-17 11:52:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:17,829 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2025-03-17 11:52:17,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 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-03-17 11:52:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2025-03-17 11:52:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 11:52:17,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:17,830 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] [2025-03-17 11:52:17,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:18,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:52:18,034 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-03-17 11:52:18,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2080891847, now seen corresponding path program 2 times [2025-03-17 11:52:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-17 11:52:18,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:18,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-17 11:52:18,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:52:18,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:18,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 11:52:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-17 11:52:18,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722811207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044953435] [2025-03-17 11:52:18,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:18,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:18,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:18,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:18,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 11:52:18,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-17 11:52:18,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:52:18,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:18,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:18,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 11:52:18,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:18,608 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 11:52:18,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044953435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:18,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:18,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2025-03-17 11:52:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780526614] [2025-03-17 11:52:18,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:18,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 11:52:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:18,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 11:52:18,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:52:18,892 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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-03-17 11:52:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:19,416 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-03-17 11:52:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 11:52:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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 63 [2025-03-17 11:52:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:19,417 INFO L225 Difference]: With dead ends: 123 [2025-03-17 11:52:19,417 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:52:19,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=2041, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:52:19,418 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:19,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 411 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:52:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:52:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:52:19,418 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-03-17 11:52:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:52:19,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-03-17 11:52:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:19,418 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:52:19,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 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-03-17 11:52:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:52:19,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:52:19,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (11 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (10 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (9 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-17 11:52:19,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-17 11:52:19,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 11:52:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:52:19,624 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:19,625 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:52:19,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:52:19 BoogieIcfgContainer [2025-03-17 11:52:19,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:52:19,627 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:52:19,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:52:19,627 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:52:19,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:51:55" (3/4) ... [2025-03-17 11:52:19,629 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:52:19,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 11:52:19,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2025-03-17 11:52:19,633 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 11:52:19,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 11:52:19,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 11:52:19,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:52:19,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:52:19,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:52:19,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:52:19,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:52:19,692 INFO L158 Benchmark]: Toolchain (without parser) took 24603.46ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 123.1MB in the beginning and 96.4MB in the end (delta: 26.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,692 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:19,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.81ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.80ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:52:19,693 INFO L158 Benchmark]: Boogie Preprocessor took 41.39ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,694 INFO L158 Benchmark]: IcfgBuilder took 338.13ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 94.5MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,694 INFO L158 Benchmark]: TraceAbstraction took 23960.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 93.9MB in the beginning and 102.2MB in the end (delta: -8.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,694 INFO L158 Benchmark]: Witness Printer took 64.29ms. Allocated memory is still 201.3MB. Free memory was 102.2MB in the beginning and 96.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:52:19,695 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.21ms. Allocated memory is still 192.9MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.81ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.80ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.39ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 109.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 338.13ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 94.5MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23960.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 93.9MB in the beginning and 102.2MB in the end (delta: -8.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 64.29ms. Allocated memory is still 201.3MB. Free memory was 102.2MB in the beginning and 96.4MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. 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, 51 locations, 63 edges, 13 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1252 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1239 mSDsluCounter, 4420 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3679 mSDsCounter, 512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4741 IncrementalHoareTripleChecker+Invalid, 5254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 512 mSolverCounterUnsat, 741 mSDtfsCounter, 4741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 456 SyntacticMatches, 12 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3105 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=17, InterpolantAutomatonStates: 244, 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, 176 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 990 NumberOfCodeBlocks, 990 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1054 ConstructedInterpolants, 52 QuantifiedInterpolants, 5987 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1838 ConjunctsInSsa, 252 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-03-17 11:52:19,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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