./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:32:54,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:32:54,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:32:54,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:32:54,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:32:55,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:32:55,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:32:55,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:32:55,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:32:55,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:32:55,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:32:55,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:32:55,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:32:55,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:32:55,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:32:55,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:32:55,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:32:55,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:32:55,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:55,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:32:55,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:32:55,011 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2025-03-04 07:32:55,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:32:55,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:32:55,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:32:55,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:32:55,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:32:55,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2025-03-04 07:32:56,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c732909/13e5a3b416294f0d9596a1ece77e2696/FLAG2ab13a52b [2025-03-04 07:32:56,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:32:56,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2025-03-04 07:32:56,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c732909/13e5a3b416294f0d9596a1ece77e2696/FLAG2ab13a52b [2025-03-04 07:32:56,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c732909/13e5a3b416294f0d9596a1ece77e2696 [2025-03-04 07:32:56,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:32:56,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:32:56,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:56,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:32:56,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:32:56,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:56" (1/1) ... [2025-03-04 07:32:56,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fe4740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:56, skipping insertion in model container [2025-03-04 07:32:56,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:56" (1/1) ... [2025-03-04 07:32:57,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:32:57,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:57,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:32:57,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:57,157 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:32:57,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57 WrapperNode [2025-03-04 07:32:57,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:57,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:57,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:32:57,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:32:57,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,185 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 46 [2025-03-04 07:32:57,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:57,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:32:57,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:32:57,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:32:57,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,212 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-04 07:32:57,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:32:57,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:32:57,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:32:57,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:32:57,231 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (1/1) ... [2025-03-04 07:32:57,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:57,254 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-04 07:32:57,255 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-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 07:32:57,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-03-04 07:32:57,273 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:32:57,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:32:57,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:32:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:32:57,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:32:57,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:32:57,519 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 07:32:57,519 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:32:57,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:32:57,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:32:57,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:57 BoogieIcfgContainer [2025-03-04 07:32:57,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:32:57,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:32:57,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:32:57,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:32:57,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:32:56" (1/3) ... [2025-03-04 07:32:57,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3156432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:57, skipping insertion in model container [2025-03-04 07:32:57,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:57" (2/3) ... [2025-03-04 07:32:57,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3156432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:57, skipping insertion in model container [2025-03-04 07:32:57,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:57" (3/3) ... [2025-03-04 07:32:57,539 INFO L128 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2025-03-04 07:32:57,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:32:57,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elimination_max_rec_onepoint.c that has 4 procedures, 65 locations, 1 initial locations, 0 loop locations, and 17 error locations. [2025-03-04 07:32:57,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:32:57,593 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;@37edb8b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:32:57,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 07:32:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:32:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:32:57,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:57,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:57,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash 643875662, now seen corresponding path program 1 times [2025-03-04 07:32:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661232307] [2025-03-04 07:32:57,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:57,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:57,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:57,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:32:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661232307] [2025-03-04 07:32:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661232307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317430565] [2025-03-04 07:32:57,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:57,746 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-04 07:32:57,747 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-04 07:32:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:57,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:32:57,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:32:57,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:32:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317430565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:57,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:32:57,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 07:32:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544455357] [2025-03-04 07:32:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:57,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:32:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:57,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:32:57,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:32:57,870 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:32:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:57,883 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-03-04 07:32:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:32:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-04 07:32:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:57,889 INFO L225 Difference]: With dead ends: 64 [2025-03-04 07:32:57,889 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 07:32:57,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-04 07:32:57,893 INFO L435 NwaCegarLoop]: 70 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, 70 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-04 07:32:57,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 07:32:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 07:32:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 50 states have internal predecessors, (52), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:32:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-03-04 07:32:57,928 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2025-03-04 07:32:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:57,928 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-03-04 07:32:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:32:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-03-04 07:32:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:32:57,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:57,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:57,941 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-04 07:32:58,134 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,SelfDestructingSolverStorable0 [2025-03-04 07:32:58,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:58,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash -224113972, now seen corresponding path program 1 times [2025-03-04 07:32:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714513952] [2025-03-04 07:32:58,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:58,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:32:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:58,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714513952] [2025-03-04 07:32:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714513952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:58,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:58,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:32:58,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632406676] [2025-03-04 07:32:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:58,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:32:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:58,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:32:58,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:32:58,441 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:32:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:58,594 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-03-04 07:32:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:32:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 07:32:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:58,597 INFO L225 Difference]: With dead ends: 106 [2025-03-04 07:32:58,597 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 07:32:58,597 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-04 07:32:58,598 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 42 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:58,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 314 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 07:32:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2025-03-04 07:32:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.56) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:32:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2025-03-04 07:32:58,611 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 22 [2025-03-04 07:32:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2025-03-04 07:32:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:32:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2025-03-04 07:32:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:32:58,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:58,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:58,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:32:58,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -225689499, now seen corresponding path program 1 times [2025-03-04 07:32:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225322116] [2025-03-04 07:32:58,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:58,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:58,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:58,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:32:58,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225322116] [2025-03-04 07:32:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225322116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:58,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:32:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444829766] [2025-03-04 07:32:58,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:58,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:32:58,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:58,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:32:58,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:58,697 INFO L87 Difference]: Start difference. First operand 85 states and 104 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:58,754 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2025-03-04 07:32:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:58,756 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 07:32:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:58,756 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:32:58,756 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:32:58,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:58,757 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:58,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:32:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:32:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.5) internal successors, (75), 64 states have internal predecessors, (75), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:32:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-03-04 07:32:58,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 22 [2025-03-04 07:32:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-03-04 07:32:58,770 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-03-04 07:32:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:32:58,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:58,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:32:58,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:58,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -225689498, now seen corresponding path program 1 times [2025-03-04 07:32:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132269409] [2025-03-04 07:32:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:58,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:58,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:59,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132269409] [2025-03-04 07:32:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132269409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:32:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116440441] [2025-03-04 07:32:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:32:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:59,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:32:59,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:32:59,091 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:59,349 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2025-03-04 07:32:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:32:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 07:32:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:59,352 INFO L225 Difference]: With dead ends: 88 [2025-03-04 07:32:59,352 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 07:32:59,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:32:59,353 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:59,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 351 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 07:32:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-03-04 07:32:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.471698113207547) internal successors, (78), 67 states have internal predecessors, (78), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 07:32:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2025-03-04 07:32:59,361 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 22 [2025-03-04 07:32:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:59,361 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2025-03-04 07:32:59,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2025-03-04 07:32:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:32:59,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:59,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:59,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:32:59,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:59,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2139244253, now seen corresponding path program 1 times [2025-03-04 07:32:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400629071] [2025-03-04 07:32:59,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:59,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:32:59,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:32:59,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:59,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:32:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400629071] [2025-03-04 07:32:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400629071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:59,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:59,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:32:59,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015761424] [2025-03-04 07:32:59,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:59,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:32:59,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:59,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:32:59,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:32:59,462 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:59,571 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2025-03-04 07:32:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:32:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-03-04 07:32:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:59,572 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:32:59,572 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 07:32:59,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:32:59,572 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:59,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 381 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 07:32:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2025-03-04 07:32:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 68 states have internal predecessors, (79), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 07:32:59,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2025-03-04 07:32:59,581 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 24 [2025-03-04 07:32:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:59,581 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2025-03-04 07:32:59,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2025-03-04 07:32:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:32:59,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:59,582 INFO L218 NwaCegarLoop]: trace histogram [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-04 07:32:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:32:59,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:59,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash 791262982, now seen corresponding path program 1 times [2025-03-04 07:32:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:59,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036919412] [2025-03-04 07:32:59,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:59,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:32:59,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:32:59,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:59,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:32:59,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:59,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036919412] [2025-03-04 07:32:59,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036919412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:59,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:59,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:32:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759595925] [2025-03-04 07:32:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:59,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:32:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:59,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:32:59,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:32:59,782 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:59,920 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-03-04 07:32:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:32:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-04 07:32:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:59,921 INFO L225 Difference]: With dead ends: 91 [2025-03-04 07:32:59,921 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:32:59,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:32:59,921 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 25 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:59,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 431 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:32:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 07:32:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 71 states have internal predecessors, (82), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 07:32:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2025-03-04 07:32:59,929 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 29 [2025-03-04 07:32:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:59,929 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2025-03-04 07:32:59,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:32:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2025-03-04 07:32:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:32:59,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:59,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:32:59,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:32:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1943830297, now seen corresponding path program 1 times [2025-03-04 07:32:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878285090] [2025-03-04 07:32:59,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:59,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:32:59,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:32:59,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:59,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878285090] [2025-03-04 07:33:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878285090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:33:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:33:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444033520] [2025-03-04 07:33:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:00,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:33:00,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:00,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:33:00,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:33:00,018 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:00,107 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2025-03-04 07:33:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:33:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2025-03-04 07:33:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:00,109 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:33:00,109 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:33:00,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:33:00,109 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:00,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:33:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-04 07:33:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 67 states have internal predecessors, (74), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 07:33:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2025-03-04 07:33:00,121 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 30 [2025-03-04 07:33:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:00,121 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2025-03-04 07:33:00,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2025-03-04 07:33:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:33:00,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:00,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:00,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:33:00,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:00,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1943830298, now seen corresponding path program 1 times [2025-03-04 07:33:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:00,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824389234] [2025-03-04 07:33:00,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:00,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:33:00,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:33:00,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:00,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:00,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824389234] [2025-03-04 07:33:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824389234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:00,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366732386] [2025-03-04 07:33:00,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:00,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:00,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:00,463 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-04 07:33:00,466 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-04 07:33:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:33:00,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:33:00,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:00,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:00,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:33:00,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:00,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:33:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:33:00,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366732386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:01,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2025-03-04 07:33:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164577211] [2025-03-04 07:33:01,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:33:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:01,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:33:01,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:33:01,089 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:33:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:01,932 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-03-04 07:33:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:33:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 30 [2025-03-04 07:33:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:01,933 INFO L225 Difference]: With dead ends: 114 [2025-03-04 07:33:01,934 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 07:33:01,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1264, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:33:01,935 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 210 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:01,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 403 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:33:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 07:33:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2025-03-04 07:33:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 69 states have internal predecessors, (76), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 07:33:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2025-03-04 07:33:01,941 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 30 [2025-03-04 07:33:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:01,944 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2025-03-04 07:33:01,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:33:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2025-03-04 07:33:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:33:01,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:01,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:01,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:02,145 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,SelfDestructingSolverStorable7 [2025-03-04 07:33:02,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 129197080, now seen corresponding path program 1 times [2025-03-04 07:33:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777213470] [2025-03-04 07:33:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:02,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:33:02,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:33:02,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:02,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777213470] [2025-03-04 07:33:02,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777213470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:02,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933476065] [2025-03-04 07:33:02,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:02,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:02,374 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-04 07:33:02,376 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-04 07:33:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:33:02,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:33:02,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:02,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:02,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:33:02,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:02,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 07:33:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:33:08,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933476065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:08,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2025-03-04 07:33:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473942669] [2025-03-04 07:33:08,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:33:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:08,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:33:08,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=475, Unknown=1, NotChecked=0, Total=552 [2025-03-04 07:33:08,248 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 24 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:33:11,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:33:14,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:33:18,554 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-04 07:33:22,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:33:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:23,580 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2025-03-04 07:33:23,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 07:33:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 31 [2025-03-04 07:33:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:23,582 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:33:23,582 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:33:23,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=334, Invalid=1827, Unknown=1, NotChecked=0, Total=2162 [2025-03-04 07:33:23,584 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 338 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 92 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:23,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 481 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 721 Invalid, 4 Unknown, 0 Unchecked, 14.7s Time] [2025-03-04 07:33:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:33:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 144. [2025-03-04 07:33:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 109 states have internal predecessors, (122), 29 states have call successors, (29), 9 states have call predecessors, (29), 10 states have return successors, (30), 25 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-04 07:33:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 181 transitions. [2025-03-04 07:33:23,591 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 181 transitions. Word has length 31 [2025-03-04 07:33:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 181 transitions. [2025-03-04 07:33:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 7 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 07:33:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2025-03-04 07:33:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:33:23,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:23,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:33:23,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:33:23,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:23,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:23,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1736083609, now seen corresponding path program 1 times [2025-03-04 07:33:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520829965] [2025-03-04 07:33:23,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:33:23,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:33:23,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:23,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:33:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520829965] [2025-03-04 07:33:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520829965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:23,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:33:23,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:33:23,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903634968] [2025-03-04 07:33:23,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:33:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:23,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:33:23,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:33:23,832 INFO L87 Difference]: Start difference. First operand 144 states and 181 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:23,860 INFO L93 Difference]: Finished difference Result 143 states and 180 transitions. [2025-03-04 07:33:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:33:23,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-04 07:33:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:23,861 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:33:23,861 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:33:23,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:33:23,862 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:33:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:33:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-04 07:33:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 108 states have internal predecessors, (121), 29 states have call successors, (29), 9 states have call predecessors, (29), 10 states have return successors, (30), 25 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-04 07:33:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2025-03-04 07:33:23,868 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 32 [2025-03-04 07:33:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2025-03-04 07:33:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2025-03-04 07:33:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:33:23,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:23,869 INFO L218 NwaCegarLoop]: trace histogram [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-04 07:33:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:33:23,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:23,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:23,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1929036534, now seen corresponding path program 1 times [2025-03-04 07:33:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861627432] [2025-03-04 07:33:23,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:23,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:23,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:33:23,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:33:23,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:23,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:33:23,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861627432] [2025-03-04 07:33:23,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861627432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:23,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:33:23,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:33:23,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502799897] [2025-03-04 07:33:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:23,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:33:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:23,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:33:23,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:33:23,931 INFO L87 Difference]: Start difference. First operand 143 states and 180 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:23,975 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2025-03-04 07:33:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:33:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-04 07:33:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:23,976 INFO L225 Difference]: With dead ends: 142 [2025-03-04 07:33:23,976 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 07:33:23,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:33:23,976 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:23,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:33:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 07:33:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-04 07:33:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 94 states have internal predecessors, (106), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 07:33:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 162 transitions. [2025-03-04 07:33:23,987 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 162 transitions. Word has length 34 [2025-03-04 07:33:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:23,987 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 162 transitions. [2025-03-04 07:33:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 162 transitions. [2025-03-04 07:33:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:33:23,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:23,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 07:33:23,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:33:23,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:23,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 293400836, now seen corresponding path program 1 times [2025-03-04 07:33:23,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177416556] [2025-03-04 07:33:23,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:23,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:33:24,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:33:24,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:24,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177416556] [2025-03-04 07:33:24,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177416556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66927354] [2025-03-04 07:33:24,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:24,128 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-04 07:33:24,130 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-04 07:33:24,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:33:24,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:33:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:24,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:24,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:33:24,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:24,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:33:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66927354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:33:24,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:33:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-03-04 07:33:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323173309] [2025-03-04 07:33:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:33:24,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:33:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:24,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:33:24,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:33:24,258 INFO L87 Difference]: Start difference. First operand 126 states and 162 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:24,376 INFO L93 Difference]: Finished difference Result 160 states and 204 transitions. [2025-03-04 07:33:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:33:24,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-03-04 07:33:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:24,378 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:33:24,378 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:33:24,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 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-04 07:33:24,378 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:24,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 249 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:33:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2025-03-04 07:33:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 97 states have internal predecessors, (109), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 07:33:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2025-03-04 07:33:24,386 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 39 [2025-03-04 07:33:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:24,387 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2025-03-04 07:33:24,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:33:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2025-03-04 07:33:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:33:24,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:24,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-04 07:33:24,396 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-04 07:33:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:24,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 291833766, now seen corresponding path program 1 times [2025-03-04 07:33:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150746307] [2025-03-04 07:33:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:24,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:33:24,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:33:24,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:24,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150746307] [2025-03-04 07:33:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150746307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315285524] [2025-03-04 07:33:24,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:24,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:24,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:24,741 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-04 07:33:24,743 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-04 07:33:24,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:33:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:33:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:24,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:33:24,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:25,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:25,064 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 29 treesize of output 25 [2025-03-04 07:33:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:33:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315285524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:25,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:25,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2025-03-04 07:33:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961133072] [2025-03-04 07:33:25,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:25,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:33:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:25,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:33:25,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:33:25,224 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 07:33:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:25,636 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2025-03-04 07:33:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:33:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 39 [2025-03-04 07:33:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:25,637 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:33:25,637 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:33:25,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:33:25,638 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 99 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:25,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 400 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:33:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:33:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2025-03-04 07:33:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 97 states have internal predecessors, (107), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 07:33:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2025-03-04 07:33:25,645 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 39 [2025-03-04 07:33:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:25,646 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2025-03-04 07:33:25,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 07:33:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2025-03-04 07:33:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:33:25,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:25,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:25,655 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-04 07:33:25,849 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,SelfDestructingSolverStorable12 [2025-03-04 07:33:25,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:25,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1279374179, now seen corresponding path program 1 times [2025-03-04 07:33:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:25,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579957705] [2025-03-04 07:33:25,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:25,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:25,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:33:25,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:33:25,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:25,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579957705] [2025-03-04 07:33:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579957705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470183445] [2025-03-04 07:33:26,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:26,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:26,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:26,086 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-04 07:33:26,088 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-04 07:33:26,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:33:26,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:33:26,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:26,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:26,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:33:26,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:26,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:26,724 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-04 07:33:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:26,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470183445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:26,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2025-03-04 07:33:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681651186] [2025-03-04 07:33:26,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:33:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:26,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:33:26,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:33:26,858 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 07:33:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:28,052 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2025-03-04 07:33:28,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 07:33:28,056 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2025-03-04 07:33:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:28,057 INFO L225 Difference]: With dead ends: 237 [2025-03-04 07:33:28,057 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 07:33:28,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=594, Invalid=3696, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 07:33:28,058 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 297 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 679 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:33:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 07:33:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 166. [2025-03-04 07:33:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 126 states have internal predecessors, (140), 28 states have call successors, (28), 11 states have call predecessors, (28), 15 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2025-03-04 07:33:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2025-03-04 07:33:28,066 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 41 [2025-03-04 07:33:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:28,066 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2025-03-04 07:33:28,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 10 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 07:33:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2025-03-04 07:33:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:33:28,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:28,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:28,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:33:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:28,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1331559382, now seen corresponding path program 1 times [2025-03-04 07:33:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096545694] [2025-03-04 07:33:28,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:28,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:33:28,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:33:28,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:28,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:33:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096545694] [2025-03-04 07:33:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096545694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207452711] [2025-03-04 07:33:28,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:28,463 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-04 07:33:28,465 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-04 07:33:28,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:33:28,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:33:28,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:28,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:28,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:33:28,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:28,580 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-04 07:33:28,846 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-04 07:33:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:33:28,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207452711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:33,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:33,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 27 [2025-03-04 07:33:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643487949] [2025-03-04 07:33:33,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:33,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:33:33,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:33,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:33:33,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:33:33,093 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 07:33:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:33,470 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2025-03-04 07:33:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:33:33,470 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 46 [2025-03-04 07:33:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:33,471 INFO L225 Difference]: With dead ends: 168 [2025-03-04 07:33:33,471 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 07:33:33,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=186, Invalid=1620, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:33:33,473 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 67 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:33,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 338 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:33:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 07:33:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-04 07:33:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 119 states have (on average 1.184873949579832) internal successors, (141), 127 states have internal predecessors, (141), 28 states have call successors, (28), 12 states have call predecessors, (28), 16 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2025-03-04 07:33:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2025-03-04 07:33:33,480 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 46 [2025-03-04 07:33:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:33,480 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2025-03-04 07:33:33,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 07:33:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2025-03-04 07:33:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:33:33,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:33,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:33,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:33:33,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:33,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:33,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1199515320, now seen corresponding path program 1 times [2025-03-04 07:33:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:33,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060352225] [2025-03-04 07:33:33,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:33,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:33,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:33:33,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:33:33,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:33,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060352225] [2025-03-04 07:33:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060352225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798588084] [2025-03-04 07:33:33,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:33,925 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-04 07:33:33,927 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-04 07:33:33,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:33:33,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:33:33,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:33,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:33,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:33:33,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 07:33:34,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:34,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:33:34,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2025-03-04 07:33:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798588084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:34,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:34,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 4] total 12 [2025-03-04 07:33:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369558646] [2025-03-04 07:33:34,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:33:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:34,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:33:34,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:33:34,284 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 07:33:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:34,469 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2025-03-04 07:33:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:33:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) Word has length 52 [2025-03-04 07:33:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:34,471 INFO L225 Difference]: With dead ends: 167 [2025-03-04 07:33:34,471 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 07:33:34,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:33:34,471 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:34,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 239 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:33:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 07:33:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-04 07:33:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 119 states have (on average 1.1512605042016806) internal successors, (137), 126 states have internal predecessors, (137), 28 states have call successors, (28), 12 states have call predecessors, (28), 16 states have return successors, (38), 28 states have call predecessors, (38), 28 states have call successors, (38) [2025-03-04 07:33:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2025-03-04 07:33:34,476 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 52 [2025-03-04 07:33:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:34,476 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2025-03-04 07:33:34,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.181818181818182) internal successors, (57), 13 states have internal predecessors, (57), 7 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 07:33:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2025-03-04 07:33:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:33:34,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:34,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:34,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:33:34,677 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,SelfDestructingSolverStorable15 [2025-03-04 07:33:34,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:34,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1682985717, now seen corresponding path program 1 times [2025-03-04 07:33:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725753145] [2025-03-04 07:33:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:34,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:33:34,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:33:34,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:34,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725753145] [2025-03-04 07:33:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725753145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194228673] [2025-03-04 07:33:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:35,092 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-04 07:33:35,093 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-04 07:33:35,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:33:35,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:33:35,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:35,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:33:35,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:35,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:35,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:33:35,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:33:35,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2025-03-04 07:33:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194228673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:36,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-03-04 07:33:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575553175] [2025-03-04 07:33:36,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:36,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:33:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:36,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:33:36,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:33:36,164 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand has 42 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 07:33:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:39,025 INFO L93 Difference]: Finished difference Result 359 states and 448 transitions. [2025-03-04 07:33:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 07:33:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) Word has length 54 [2025-03-04 07:33:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:39,027 INFO L225 Difference]: With dead ends: 359 [2025-03-04 07:33:39,027 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 07:33:39,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=706, Invalid=6776, Unknown=0, NotChecked=0, Total=7482 [2025-03-04 07:33:39,029 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 295 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:39,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 828 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:33:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 07:33:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 223. [2025-03-04 07:33:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 167 states have (on average 1.1497005988023952) internal successors, (192), 169 states have internal predecessors, (192), 32 states have call successors, (32), 12 states have call predecessors, (32), 20 states have return successors, (51), 41 states have call predecessors, (51), 32 states have call successors, (51) [2025-03-04 07:33:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 275 transitions. [2025-03-04 07:33:39,040 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 275 transitions. Word has length 54 [2025-03-04 07:33:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:39,040 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 275 transitions. [2025-03-04 07:33:39,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-04 07:33:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 275 transitions. [2025-03-04 07:33:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 07:33:39,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:39,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:39,049 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-04 07:33:39,242 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,SelfDestructingSolverStorable16 [2025-03-04 07:33:39,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:39,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1367217098, now seen corresponding path program 1 times [2025-03-04 07:33:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085329671] [2025-03-04 07:33:39,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:39,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:33:39,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:33:39,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:39,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:39,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085329671] [2025-03-04 07:33:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085329671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:39,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452265126] [2025-03-04 07:33:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:39,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:39,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:39,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:39,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:33:39,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 07:33:39,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 07:33:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:39,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:33:39,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:39,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:39,791 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 29 treesize of output 25 [2025-03-04 07:33:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:33:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452265126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:40,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:40,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 33 [2025-03-04 07:33:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977381227] [2025-03-04 07:33:40,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:40,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 07:33:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 07:33:40,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:33:40,345 INFO L87 Difference]: Start difference. First operand 223 states and 275 transitions. Second operand has 33 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 07:33:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:41,061 INFO L93 Difference]: Finished difference Result 365 states and 460 transitions. [2025-03-04 07:33:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:33:41,061 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) Word has length 54 [2025-03-04 07:33:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:41,062 INFO L225 Difference]: With dead ends: 365 [2025-03-04 07:33:41,062 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 07:33:41,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=279, Invalid=2271, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 07:33:41,063 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 48 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:41,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 693 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:33:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 07:33:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 153. [2025-03-04 07:33:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 115 states have internal predecessors, (125), 27 states have call successors, (27), 12 states have call predecessors, (27), 15 states have return successors, (34), 25 states have call predecessors, (34), 26 states have call successors, (34) [2025-03-04 07:33:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 186 transitions. [2025-03-04 07:33:41,071 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 186 transitions. Word has length 54 [2025-03-04 07:33:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 186 transitions. [2025-03-04 07:33:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 11 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 07:33:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 186 transitions. [2025-03-04 07:33:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 07:33:41,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:41,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:41,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:33:41,272 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1706629777, now seen corresponding path program 1 times [2025-03-04 07:33:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8846335] [2025-03-04 07:33:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:41,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:33:41,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:33:41,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 07:33:41,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8846335] [2025-03-04 07:33:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8846335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854380453] [2025-03-04 07:33:41,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:41,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:41,381 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:41,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:33:41,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 07:33:41,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 07:33:41,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:41,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:41,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:33:41,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:33:41,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:42,047 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 35 treesize of output 31 [2025-03-04 07:33:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 07:33:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854380453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:42,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 29 [2025-03-04 07:33:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921400457] [2025-03-04 07:33:42,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:33:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:33:42,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:33:42,227 INFO L87 Difference]: Start difference. First operand 153 states and 186 transitions. Second operand has 29 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-04 07:33:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:42,931 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2025-03-04 07:33:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 07:33:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) Word has length 56 [2025-03-04 07:33:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:42,934 INFO L225 Difference]: With dead ends: 132 [2025-03-04 07:33:42,934 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 07:33:42,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=1869, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:33:42,935 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 180 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:42,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 496 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:33:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 07:33:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2025-03-04 07:33:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 91 states have internal predecessors, (97), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-04 07:33:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2025-03-04 07:33:42,939 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 56 [2025-03-04 07:33:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:42,939 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2025-03-04 07:33:42,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 12 states have call successors, (23), 8 states have call predecessors, (23), 4 states have return successors, (17), 11 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-04 07:33:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2025-03-04 07:33:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:33:42,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:42,940 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:43,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:43,144 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:43,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1900143819, now seen corresponding path program 1 times [2025-03-04 07:33:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640962699] [2025-03-04 07:33:43,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:33:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:33:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:33:43,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640962699] [2025-03-04 07:33:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640962699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929336511] [2025-03-04 07:33:43,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:43,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:43,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:43,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:43,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:33:43,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:33:43,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:33:43,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:43,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:43,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 07:33:43,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:33:43,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929336511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:44,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:44,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2025-03-04 07:33:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666587905] [2025-03-04 07:33:44,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:44,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:33:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:44,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:33:44,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:33:44,006 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 26 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 07:33:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:44,939 INFO L93 Difference]: Finished difference Result 236 states and 289 transitions. [2025-03-04 07:33:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:33:44,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 71 [2025-03-04 07:33:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:44,940 INFO L225 Difference]: With dead ends: 236 [2025-03-04 07:33:44,940 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:33:44,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=3107, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 07:33:44,941 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 160 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:44,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 799 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:33:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:33:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 146. [2025-03-04 07:33:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1018518518518519) internal successors, (119), 109 states have internal predecessors, (119), 23 states have call successors, (23), 10 states have call predecessors, (23), 13 states have return successors, (32), 26 states have call predecessors, (32), 22 states have call successors, (32) [2025-03-04 07:33:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2025-03-04 07:33:44,948 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 71 [2025-03-04 07:33:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:44,949 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2025-03-04 07:33:44,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 10 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 07:33:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2025-03-04 07:33:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 07:33:44,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:44,950 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:44,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:45,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:45,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:45,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -655379338, now seen corresponding path program 1 times [2025-03-04 07:33:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355379473] [2025-03-04 07:33:45,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:45,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:33:45,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:33:45,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:45,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:33:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:45,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355379473] [2025-03-04 07:33:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355379473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:45,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941986454] [2025-03-04 07:33:45,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:45,393 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:45,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:33:45,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 07:33:45,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 07:33:45,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:45,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:45,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:33:45,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:33:45,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941986454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:45,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2025-03-04 07:33:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654998953] [2025-03-04 07:33:45,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:33:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:45,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:33:45,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:33:45,907 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 25 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 9 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 07:33:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:46,594 INFO L93 Difference]: Finished difference Result 205 states and 249 transitions. [2025-03-04 07:33:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 07:33:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 9 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 71 [2025-03-04 07:33:46,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:46,595 INFO L225 Difference]: With dead ends: 205 [2025-03-04 07:33:46,595 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 07:33:46,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=383, Invalid=2479, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 07:33:46,596 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 161 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:46,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 416 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:33:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 07:33:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2025-03-04 07:33:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.1066666666666667) internal successors, (83), 78 states have internal predecessors, (83), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-04 07:33:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2025-03-04 07:33:46,600 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 71 [2025-03-04 07:33:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:46,600 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2025-03-04 07:33:46,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 9 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 07:33:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2025-03-04 07:33:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 07:33:46,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:46,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:46,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:33:46,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:33:46,801 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:46,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1900849664, now seen corresponding path program 1 times [2025-03-04 07:33:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39824179] [2025-03-04 07:33:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:46,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 07:33:46,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 07:33:46,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:46,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 07:33:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39824179] [2025-03-04 07:33:47,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39824179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047948155] [2025-03-04 07:33:47,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:33:47,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:47,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:47,148 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:47,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:33:47,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 07:33:47,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 07:33:47,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:33:47,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:47,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:33:47,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 07:33:47,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:47,638 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-04 07:33:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 07:33:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047948155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:33:47,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:33:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-03-04 07:33:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005931354] [2025-03-04 07:33:47,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 07:33:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:47,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 07:33:47,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 07:33:47,797 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 36 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (32), 12 states have call predecessors, (32), 2 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 07:33:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:48,417 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2025-03-04 07:33:48,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 07:33:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (32), 12 states have call predecessors, (32), 2 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 82 [2025-03-04 07:33:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:48,419 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:33:48,419 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 07:33:48,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=558, Invalid=2198, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:33:48,421 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 197 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:48,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 470 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:33:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 07:33:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 138. [2025-03-04 07:33:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.1) internal successors, (110), 101 states have internal predecessors, (110), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2025-03-04 07:33:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2025-03-04 07:33:48,427 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 82 [2025-03-04 07:33:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2025-03-04 07:33:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 26 states have internal predecessors, (82), 17 states have call successors, (32), 12 states have call predecessors, (32), 2 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 07:33:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2025-03-04 07:33:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 07:33:48,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:48,428 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:48,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:33:48,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:48,628 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:48,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1864860452, now seen corresponding path program 2 times [2025-03-04 07:33:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318163655] [2025-03-04 07:33:48,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:48,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-04 07:33:48,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 07:33:48,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:48,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 07:33:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318163655] [2025-03-04 07:33:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318163655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786767194] [2025-03-04 07:33:48,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:33:48,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:48,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:48,948 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:48,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:33:48,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-04 07:33:49,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 07:33:49,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:33:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:49,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:33:49,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 07:33:49,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786767194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:49,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2025-03-04 07:33:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703625868] [2025-03-04 07:33:49,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:33:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:49,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:33:49,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1378, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:33:49,622 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 34 states, 28 states have (on average 2.607142857142857) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 07:33:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:50,893 INFO L93 Difference]: Finished difference Result 284 states and 340 transitions. [2025-03-04 07:33:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 07:33:50,893 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.607142857142857) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) Word has length 88 [2025-03-04 07:33:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:50,894 INFO L225 Difference]: With dead ends: 284 [2025-03-04 07:33:50,894 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:33:50,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=553, Invalid=4003, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 07:33:50,895 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 230 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:50,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 960 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:33:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:33:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 134. [2025-03-04 07:33:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 97 states have (on average 1.0824742268041236) internal successors, (105), 98 states have internal predecessors, (105), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2025-03-04 07:33:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2025-03-04 07:33:50,899 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 88 [2025-03-04 07:33:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2025-03-04 07:33:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.607142857142857) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-04 07:33:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2025-03-04 07:33:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 07:33:50,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:33:50,900 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:50,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:33:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:51,100 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 14 more)] === [2025-03-04 07:33:51,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:33:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -620095971, now seen corresponding path program 3 times [2025-03-04 07:33:51,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:33:51,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700227882] [2025-03-04 07:33:51,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:33:51,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 5 equivalence classes. [2025-03-04 07:33:51,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 88 statements. [2025-03-04 07:33:51,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:33:51,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 07:33:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:33:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700227882] [2025-03-04 07:33:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700227882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328477247] [2025-03-04 07:33:51,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:33:51,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:33:51,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:33:51,305 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:33:51,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:33:51,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 5 equivalence classes. [2025-03-04 07:33:51,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 88 statements. [2025-03-04 07:33:51,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:33:51,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:33:51,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:33:51,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:33:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 07:33:51,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:33:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328477247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:33:51,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:33:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2025-03-04 07:33:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454271199] [2025-03-04 07:33:51,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:33:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:33:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:33:51,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:33:51,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:33:51,768 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 22 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 9 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-04 07:33:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:33:52,391 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2025-03-04 07:33:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 07:33:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 9 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 88 [2025-03-04 07:33:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:33:52,392 INFO L225 Difference]: With dead ends: 218 [2025-03-04 07:33:52,392 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:33:52,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=342, Invalid=1820, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:33:52,393 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 98 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:33:52,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 428 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:33:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:33:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:33:52,393 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-04 07:33:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:33:52,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2025-03-04 07:33:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:33:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:33:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.95) internal successors, (59), 18 states have internal predecessors, (59), 9 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-04 07:33:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:33:52,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:33:52,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (16 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (15 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (14 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (13 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2025-03-04 07:33:52,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2025-03-04 07:33:52,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 07:33:52,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:33:52,600 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:33:52,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:33:52,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:33:52 BoogieIcfgContainer [2025-03-04 07:33:52,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:33:52,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:33:52,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:33:52,605 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:33:52,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:57" (3/4) ... [2025-03-04 07:33:52,608 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:33:52,612 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 07:33:52,612 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check [2025-03-04 07:33:52,612 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 07:33:52,615 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-04 07:33:52,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 07:33:52,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 07:33:52,616 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:33:52,673 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:33:52,673 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:33:52,673 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:33:52,673 INFO L158 Benchmark]: Toolchain (without parser) took 55688.75ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.2MB in the beginning and 143.9MB in the end (delta: -21.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,673 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:33:52,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.28ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:33:52,674 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,674 INFO L158 Benchmark]: IcfgBuilder took 305.99ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 92.0MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,674 INFO L158 Benchmark]: TraceAbstraction took 55070.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 91.2MB in the beginning and 149.1MB in the end (delta: -57.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,675 INFO L158 Benchmark]: Witness Printer took 68.31ms. Allocated memory is still 243.3MB. Free memory was 149.1MB in the beginning and 143.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:33:52,675 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.16ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.28ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 108.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 305.99ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 92.0MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 55070.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 91.2MB in the beginning and 149.1MB in the end (delta: -57.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 68.31ms. Allocated memory is still 243.3MB. Free memory was 149.1MB in the beginning and 143.9MB in the end (delta: 5.3MB). 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: 40]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 52]: 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: -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, 65 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2681 SdHoareTripleChecker+Valid, 20.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2642 mSDsluCounter, 9972 SdHoareTripleChecker+Invalid, 19.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8871 mSDsCounter, 1044 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10766 IncrementalHoareTripleChecker+Invalid, 11814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1044 mSolverCounterUnsat, 1101 mSDtfsCounter, 10766 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1888 GetRequests, 1115 SyntacticMatches, 25 SemanticMatches, 748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7158 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=17, InterpolantAutomatonStates: 448, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 726 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.2s InterpolantComputationTime, 1943 NumberOfCodeBlocks, 1867 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2333 ConstructedInterpolants, 74 QuantifiedInterpolants, 13853 SizeOfPredicates, 112 NumberOfNonLiveVariables, 3413 ConjunctsInSsa, 447 ConjunctsInUnsatCore, 49 InterpolantComputations, 10 PerfectInterpolantSequences, 1271/1601 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:33:52,698 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